1 3
Kiki Cici
#include <iostream> #include <cstring> using namespace std; const int x[11]={1,2,4,8,16,32,64,128,256,512,1024}; int n,sg[1001]={0}; void solve(){ int temp[1000],i,j=0; for (i=1;i<=1000;++i){ memset(temp,0,sizeof(temp)); while (i>=x[j]){ temp[sg[i-x[j]]]=1; j++; } for (j=0;temp[j];++j); sg[i]=j; j=0; } } int main() { solve(); while (cin>>n) if (sg[n]) cout<<"Kiki\n"; else cout<<"Cici\n"; return 0; }
#include <iostream> using namespace std; const int x[10]={1,2,4,8,16,32,64,128,256,512}; int n,pn[2000]={0}; int main() { for (int i=0;i<=1000;++i) if (!pn[i]) for (int j=0;j<10;++j) pn[i+x[j]]=1; while (cin>>n) if (pn[n]) cout<<"Kiki\n"; else cout<<"Cici\n"; return 0; }
#include <iostream> using namespace std; int n; int main() { while (cin>>n) if (n%3) cout<<"Kiki\n"; else cout<<"Cici\n"; return 0; }
kdwycz的网站: http://kdwycz.com/
kdwyz的刷题空间:http://blog.csdn.net/kdwycz
HDOJ 1847 Good Luck in CET-4 Everybody! 博弈论的多种姿势,布布扣,bubuko.com
HDOJ 1847 Good Luck in CET-4 Everybody! 博弈论的多种姿势
原文:http://blog.csdn.net/kdwycz/article/details/24142755