ペアノの公理:
以下を満たすような集合 N の要素を自然数とする.
- O ∈ N
>2. 任意の x ∈ N について s(x) ∈ N このとき s(x) を x の後者と呼ぶ.
| ##Q.1 | |
| print "trats"[::-1] | |
| ##Q.2 | |
| print 8 not in range(7,8) | |
| ##Q.3 | |
| print 0.0 is 0 | |
| ##Q.4 |
| #include<stdio.h> | |
| int q1(); | |
| int q2(); | |
| int q3(); | |
| int q4(); | |
| int q5(); | |
| int q6(); | |
| int q7(); | |
| char* q8(); |
When the directory structure of your Node.js application (not library!) has some depth, you end up with a lot of annoying relative paths in your require calls like:
const Article = require('../../../../app/models/article');Those suck for maintenance and they're ugly.
| while { | |
| let x = foo(); | |
| bar(x); | |
| x != 0 | |
| } {} |
| /* | |
| * robotNav.js | |
| * | |
| * The green key is located in a slightly more | |
| * complicated room. You'll need to get the robot | |
| * past these obstacles. | |
| */ | |
| function startLevel(map) { | |
| // Hint: you can press R or 5 to "rest" and not move the |
| /* | |
| * robotMaze.js | |
| * | |
| * The blue key is inside a labyrinth, and extracting | |
| * it will not be easy. | |
| * | |
| * It's a good thing that you're a AI expert, or | |
| * we would have to leave empty-handed. | |
| */ |
| /************************** | |
| * exceptionalCrossing.js * | |
| ************************** | |
| * | |
| * Sorry, old friend, but I'm afraid I can't share | |
| * co-authorship on this paper. You've done a very | |
| * good job getting this Algorithm for me. The bit | |
| * with the keys was especially clever! I wouldn't | |
| * have thought of it myself. But then, of course, | |
| * that's why you were here in the first place. |