标签:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21219 Accepted Submission(s):
8308
3 5 15 20 63923 99999
3 5 Good Choice
15 20 Bad Choice
63923 99999 Good Choice
//考虑大数;注意格式;
1 #include<stdio.h> 2 #define MAX 100010; 3 4 int gcd(int a, int b) //最大公约数; 5 { 6 if(!b) return a; 7 else 8 return gcd(b,a%b); 9 } 10 11 int main() 12 { 13 int m,n; 14 while(~scanf("%d %d",&m,&n)) 15 { 16 int len=gcd(m,n); 17 if(len==1) 18 printf("%10d%10d Good Choice\n\n"); 19 else 20 printf("%10d%10d Bad Chioce\n\n"); 21 22 } 23 }
1 #include<stdio.h> 2 int main() 3 { 4 int m,n; 5 while(~scanf("%d %d",&m,&n)) 6 { 7 printf("%10d%10d",m,n); 8 int total=0,i; 9 for(i=0;;i++) 10 { 11 total=(total+m)%n; 12 if(total==0) 13 break; 14 } 15 if(i==n-1) 16 printf(" Good Choice\n"); 17 else 18 printf(" Bad Choice\n"); 19 printf("\n"); 20 21 } 22 return 0; 23 }
标签:
原文地址:http://www.cnblogs.com/fengshun/p/4600823.html