链接:http://acm.hdu.edu.cn/showproblem.php?pid=1014
代码:
#include<cstdio>
#include<cstring>
#define N 100005
int Time[N],step,num[N],mod;
int flag=1;
int main()
{
while(scanf("%d%d",&step,&mod)!=EOF)
{
memset(Time,0,sizeof(Time));
memset(num,0,sizeof(num));
Time[0] = 1;
for(int i=1;i<N;i++)
{
num[i]=(num[i-1]+step) % mod;
Time[num[i]]++;
if(num[i] == num[i-1])
break;
}
for(int i=0;i<mod;i++)
{
if(Time[i]==0) {
flag=0;
break;
}
else
flag=1;
}
if(1==flag)
printf("%10d%10d Good Choice\n\n",step,mod);
else
printf("%10d%10d Bad Choice\n\n",step,mod);
}
return 0;
}