Cod sursa(job #253402)
Utilizator | Data | 5 februarie 2009 19:10:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<stdio.h>
long T,a,b;
long cmmdc(long a,long b)
{long r=a%b;
while(r)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{ freopen("euclid2.in","r",stdin); freopen("euclid2.out","w",stdout);
scanf("%ld",&T);
for(long i=1;i<=T;i++)
{scanf("%ld %ld",&a,&b);
if(a>b) a+=b,b=a-b,a-=b;
printf("%ld\n",cmmdc(a,b));
}
return 0;
}