FizzBuzz solved using only bit twiddling. It essentially uses two deterministic finite automata for divisibility testing.fizzbuzz.c �� �HV @� �HV #include <stdio.h> int f0(unsigned int x) { return x? (x&(1<<31)? f1(x<<1) : f0(x<<1)) : 1; } int f1(unsigned int x) { return x? (x&(1<<31)? f3(x<<1) : f2(x<<1)) : 0; } int f2(unsigned int x) { return x? (x&(1<<31)? f0(x<<1) : f4(x<<1)) : 0; } int f3(unsigned int x) { return x? (x&(1<<31)? f2(x<<1) : f1(x<<1)) : 0; } int f4(unsigned int x) { return x? (x&(1<<31)? f4(x<<1)
