#include<iostream>
#include<iomanip>
#include<queue>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int MAX=1111;
int C,N,M,SG[MAX],S[MAX];
void GetSG()
{
memset(SG,0,sizeof(SG));
for (int i=1;i<=N;i++)
{
memset(S,0,sizeof(S));
for (int j=1;j<=M&&i-j>=0;j++)
S[SG[i-j]]=1;
for (int j=0;j<=N;j++)
if (!S[j])
SG[i]=j,j=N+12345;
}
}
int main()
{
cin.sync_with_stdio(false);
cin>>C;
while (C--)
{
cin>>N>>M;
GetSG();
if (SG[N])
cout<<"first\n";
else
cout<<"second\n";
}
return 0;
}
题意很好理解,就是个巴什博弈的题目,一次可以去走1,2,3…m个石子,容易得出该问题的PN图, 1,2,3...m为必胜状态,m+1为必败状态,其余类推即可。
#include<iostream>
#include<iomanip>
#include<queue>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int C,N,M;
int main()
{
cin.sync_with_stdio(false);
cin>>C;
while (C--)
{
cin>>N>>M;
if (N%(M+1)!=0)
cout<<"first\n";
else
cout<<"second\n";
}
return 0;
}
HDU 1846 Brave Game (巴什博弈) SG
最新推荐文章于 2021-02-27 23:02:06 发布