Moderators: Darobat, RecursiveS, Dante Shamest, Bugdude, Wizard, raimo
#include <stdio.h>
char*_="XxTIHRCXCxTIHRXRCxTIHXHRCxTIXIHRCxTXTIHRCxXxTIHRCX";
int main(int l){for(l+=7;l!=putchar(010);++l);if(*(++_))main
(*_!=88?(putchar(*_^073)|putchar(33))&1:0xffff2a8b);}#include <stdio.h>
char*_="XxTIHRCXCxTIHRXRCxTIHXHRCxTIXIHRCxTXTIHRCxXxTIHRCX";
int main(int l){for(l+=7;l!=putchar(010);++l);if(*(++_))main
(*_!=88?(putchar(*_^073)|putchar(33))&1:0xffff2a8b);}Sorry. You won't have to worry about that. The direction will always point to another number or 'e'.exomo wrote:First working version: 238
Anybody wants to answer my question? (Darobat) I could save a million tokens if I knew.
#include <stdio.h>
struct W{char m,M[4??),w;void x(char
*W)??<w^=w;while(w[W]!=0)putchar(W[w
]^M[w++%5??));}W():m(040),w(0){char*
X="d@PLfAU\x05P)sHEMoTTPF""\31";for(
;w<5;w++[M??)=m++);x(X);}}w;main(){}1 h 4 s h 9 e
2 3
l 3 wBeer Hunter wrote:133 tokens. This is not counting that pesky '#include "stdafx.h"' that is required to compile in VS2003. (It's 136 tokens if you include that.) I've used a couple of VS2003-specific tricks to knock off 5 tokens. If I wanted this to compile in the average C++ compiler, it would be 138. In any case, I think I'm doing pretty well now!
#include <stdio.h>
char*_="XxTIHRCXCxTIHRXRCxTIHXHRCxTIXIHRCxTXTIHRCxXxTIHRCX";
int main(int l){for(l+=7;l!=putchar(010);++l);if(*(++_))main
(*_!=88?(putchar(*_^073)|putchar(33))&1:0xffff2a8b);}Users browsing this forum: No registered users and 1 guest