#include<stdio.h>
#include<stdlib.h>
/*实际上是求最大公约数*/
int gys(int a,int b)
{
int t;
if(a<b)
{
t=a;
a=b;
b=t;
}
while(b!=0)
{
t=a%b;
a=b;
b=t;
}
return a;
}
int main()
{
int step,mod;
int n,i,j,k,tag;
while(scanf("%d%d",&step,&mod)!=EOF)
{
if(gys(step,mod)==1)tag=0;
else tag=1;
printf("%10d%10d ",step,mod);
if(tag)printf("Bad Choice\n\n");
else printf("Good Choice\n\n");
}
return 0;
}
UVA - 408 - Uniform Generator
最新推荐文章于 2018-03-22 14:02:16 发布