JOJ1012: Diophantus was a Greek, not a geek.

原来题位置：http://acm.jlu.edu.cn/joj/showproblem.php?pid=1012

这是简单的计算最大公约数的Eclude算法

#include <stdio.h>

int gcd(int a,int b)
{
    int r;
    while(b!=0)
    {
        r = a%b;
        a = b;
        b = r;
       
    }
    return a;
}

int main(int argc, char *argv[])
{
  int i,n,a,b,c;
  char aa,bb,cc,dd;
  scanf("%d",&n);
  while(n>0){
      scanf("%d%c%c%d%c%c%d",&a,&aa,&bb,&b,&cc,&dd,&c);
      int gcdValue = gcd(a,b);
      if(c % gcdValue == 0)
         printf("%d%c%c%d%c%c%d has a solution./n",a,aa,bb,b,cc,dd,c);
      else
         printf("%d%c%c%d%c%c%d has no solution./n",a,aa,bb,b,cc,dd,c);
      n--;
  }
 
  system("PAUSE"); 
  return 0;
}