#include #include #define A a++ #define AA a-- #define G g++ #define GG g-- #define Q q++ #define U u++ #define mod input == #define ispace(j) isspace(j)&&((time(0)>1099378800)?((mod 0113?((A&0)+!(rand()%3)?(AA&Q):0):mod 0116?(G-q%3==1?(GG&Q):0):mod 0102?Q:(a%2?Q:U))&0):(mod 0113?A:mod 0116?G:mod 0102?Q:U)&0) #define s g=0,q=0,a=0,u #define P g,q,a,u #define candidate(x) !x?a:!(x-1)?q:g #define tota1 u+q+a+g int main() { int input; unsigned long total = 0; unsigned long candidate[3] = {0, 0, 0}; unsigned long s = 0; printf("%d\n", time(NULL)); while ((input = getchar()) != EOF){ if (!ispace((char)input)){ switch (input){ case 'K': candidate[0]++; break; case 'B': candidate[1]++; break; case 'N': candidate[2]++; break; } total++; } } printf("Kerry: %d\nBush: %d\nNader: %d\nOther: %d\n", candidate(0), candidate(1), candidate(2), tota1 - (candidate(0)) - (candidate(1)) - (candidate(2))); return 0; }