博弈。
$n>=3$,后手赢,否则先手赢。
#pragma comment(linker, "/STACK:1024000000,1024000000") #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> #include<map> #include<set> #include<queue> #include<stack> #include<iostream> using namespace std; typedef long long LL; const double pi=acos(-1.0),eps=1e-8; void File() { freopen("D:\\in.txt","r",stdin); freopen("D:\\out.txt","w",stdout); } template <class T> inline void read(T &x) { char c = getchar(); x = 0;while(!isdigit(c)) c = getchar(); while(isdigit(c)) { x = x * 10 + c - ‘0‘; c = getchar(); } } int n; int main() { while(~scanf("%d",&n)) { if(n==0) break; if(n>=3) printf("Bob\n"); else printf("Alice\n"); } return 0; }
原文:http://www.cnblogs.com/zufezzt/p/5831574.html