HDOJ1014 Uniform Generator

Problem : 1014 ( Uniform Generator )     Judge Status : Accepted
RunId : 7742145    Language : C    Author : qq1203456195
Code Render Status : Rendered By HDOJ C Code Render Version 0.01 Beta

依题意可知，只要两个数的最大公约数为1就ok了~

#include <stdio.h>
int gcd(int a,int b)
{
    int t,min,max;
    min=a<b?a:b;
    max=a<b?b:a;
    while (t=max%min,t!=0)
    {    
        max=min;
        min=t;
    }
    return min;
}
int main()
{
    int a,b,g;
    while (~scanf("%d%d",&a,&b))
    {
        g=gcd(a,b);
        printf("%10d%10d    ",a,b);
        if(g>1)
            printf("Bad Choice\n\n");
        else
            printf("Good Choice\n\n");
    }
    return 0;
}