#define C(c) #c #include #include #include typedef int I; I d, i, j, a, b, l, u[16], v[18], w[36], x, y, z, k; char *p, *q, *t[17], m[4], *P = "\n (),"; void O(char *q) { for(; *q; q++) *q > 32 ? z = 111 - *q ? z = (z + *q) % 185, (k ? k-- : (y = z % 37, (x = z / 37 % 7) ? printf(*t, t[x], y ? w[y - 1] : 95) : y > 14 && y < 33 ? x = y > 15, printf(t[15 + x], x ? 2 << y % 16 : l, x ? (1 << y % 16) - 1 : 1) : puts(t[y % 28]))), 0 : z + 82 : 0; } void Q(I p, I *q) { for(x = 0; x < p; x++) q[x] = x; for(; --p > 1; q[p] = y) y = q[x = rand() % -~p], q[x] = q[p]; } char n[4096] = C(Qd%R>Rd%R%%RNIPRfi#VQ}R;TtuodtsRUd%RUd%RUOSetirwf!RnruterR{RTSniamRtniQ>h.oidtsrebmun<=NIPD-RhtiwRelipmocResaelPRrorre#QNIPRfednfi#V__ELIF__R_Renifed#V~-VU0V;}V{R=R][ORrahcRdengisnuRtsnocRcitatsVesle#Vfidne#V53556..1RfoRegnarRehtRniRregetniRnaRsiR]NIP[RerehwQQc.tuptuoR>Rtxt.tupniR 32 && !(*--q = *p > 80 && *p < 87 ? P[*p - 81] : *p) ? t[--x] = q + 1 : q; if( f - 2 || (d = atoi(e[1])) < 1 || d > 65535 ) return O("\""), 1; srand(time(NULL)); Q(16, u); Q(36, w); for(i = 0; i < 36; i++) w[i] += w[i] < 26 ? 97 : 39; O(C(ou oo9 oB ot ow]# ox^# oy_# oz`# o{a# o|b# o}c# o~d# oo-e# oo.f# oo/g# oo0h# oo1i# oo2j# oo3k# oo4l# op)); for(j = 8; (i = getchar()) != EOF; l++) { a = rand() % 16 + 1; for(b = 0; b < a || main(0, NULL) - i; b++) x = d ^ d / 4 ^ d / 8 ^ d / 32, d = (d / 2 | x << 15) & 65535; Q(18, v); b |= 1 << 17; for(a = 0; a < 18; a++) if( (b & (1 << (i = v[a]))) ) *m = 75 + i, O(m), j = i < 17 && j < i ? i : j; O("!"); } O(C( oq ov oo9 7 o/ n !)); for(i = 0; i < 8; O(m)) *m = 56 + u[i], m[1] = 75 + i++, m[2] = 35; O(C( oA ! or oo9 )); k = 112 - j * 7; O(C( 6o.!Z!Z# 5o-!Y!Y# 4~!X!X# 3}!W!W# 2|!V!V# 1{!U!U# 0z!T!T# /y!S!S# .x!R!R# -w!Q!Q# ooAv!P!P# +u!O!O# *t!N!N# oo>s!M!M# oo=r!L!L# oob# o6?c# o7@d# o8Ae# o9Bf# o:Cg# o;Dh# oGk# o?Hl# oo9 os # # # # # )); d = 0; } for(x = y = 0; x < 8; x++) y |= d & (1 << u[x]) ? 1 << x : 0; return y; }