Hdu1847good Luck in CET-4 everybody! Game

Can be found is 3, for any number we can subtract 1 or 2 to get a multiple of 3, and a multiple of three
cannot be taken out at once
In doing the time to find a must defeat, but did not think of a multiple of three, so had to force the enumeration of all the winning and must defeat point
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace Std;
const int MAXN = 1010;
int POS[MAXN];
int main ()
{
memset (POS, 0, sizeof (POS));
POS[1] = 1;
POS[2] = 1;
for (int i = 3;i <=; i++)
{
if (!pos[i])
{
for (int j = 0; (1<<j) <=1000; j + +)
pos[i+ (1<<j)] = 1;
}
}
int n;
while (~SCANF ("%d", &n))
{
if (Pos[n]) printf ("kiki\n");
else printf ("cici\n");
}
return 0;
}

Hdu1847good Luck in CET-4 everybody! Game