User blog comment:Vel!/Laver.c/@comment-1605058-20140821210502/@comment-25418284-20140821212516

R return W while ( X(a, b) (L >> (((b) N) + (a)) n) % N int L, n, N; main { R Q(Q(Q(99))); } Q(a) { n = 2 W P(++n) < a); R n; } P { int i; N = i = 1 << n; L = 0 W --i) L = L N + i % N W V) L += 1 << N n; i = 0 W X(0, ++i) - 1); R i; } V { int i, j, k; i = N W i--) { j = N W j--) { k = N W k--) { if (X(i, X(j, k)) - X(X(i, j), X(i, k))) R 1; } } } R 0; }
 * 1) define
 * 1) define
 * 1) define