【HDU 1847】 Good Luck in CET-4 Everybody!

#include<bits/stdc++.h>
using namespace std;
#define MAXN 1010

int n;
int f[MAXN];

inline bool dfs(int n)
{
        int i;
        if (f[n] != -1) return f[n];
        f[n] = false;
        for (i = 0; i <= 10; i++)
        {
                if (n - (1 << i) >= 0)
                        f[n] |= (!dfs(n-(1<<i)));
        }   
        return f[n];
}
int main() 
{
        
        memset(f,255,sizeof(f));
        f[0] = false;
        while (scanf("%d",&n) != EOF)
        {
                if (dfs(n)) printf("Kiki\n");
                else printf("Cici\n");        
        }
        
        return 0;
    
}