HDU - 1847(34600)

爆搜….没啥好说的

#include<iostream> #include<cstring> #include<cstdio> #include<algorithm> #include<queue> using namespace std; int t[10] = { 1,2,4,8,16,32,64,128,256,512 }; int dp[1001]; void dfs(int gg) { if (!gg) { dp[gg] = 2; return; } if (dp[gg])return; for (int a = 0; a < 10; a++) { if (gg - t[a]<0)break; dfs(gg - t[a]); if (dp[gg - t[a]] == 2) { dp[gg] = 1; return; } } dp[gg] = 2; } int main() { int n; while (cin >> n) { dfs(n); if (dp[n] % 2)cout << "Kiki" << endl; else cout << "Cici" << endl; } }