取石子游戏 【传送门】
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 9884 Accepted Submission(s): 5973
Problem Description
1堆石子有n个,两人轮流取.先取者第1次可以取任意多个,但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win".
Input
输入有多组.每组第1行是2<=n<2^31. n=0退出.
Output
先取者负输出"Second win". 先取者胜输出"First win".
参看Sample Output.
Sample Input
2
13
10000
0
Sample Output
Second win
Second win
First win
Source
斐波那契博弈,直接套公式!
博弈论专题链接:https://blog.csdn.net/lesileqin/article/details/98525887
AC代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<algorithm>
#include<queue>
#include<stack>
using namespace std;
#define INF 999999
#define MOD 2009
#define MAXN 50
#define mem(a,b) memset(a,b,sizeof(a))
typedef long long ll;
ll f[MAXN];
bool solve(int n){
for(int i=1;f[i-1]<n;i++){
if(f[i]==n)
return false;
}
return true;
}
int main(){
ios::sync_with_stdio(false);
int n;
f[0]=f[1]=1;
for(int i=2;i<MAXN;i++){
f[i]=f[i-1]+f[i-2];
}
while(cin >> n && n){
if(solve(n)) cout << "First win\n";
else cout << "Second win\n";
}
return 0;
}