Cod sursa(job #1116034)
Utilizator | Data | 22 februarie 2014 12:04:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<cstdio>
int n,i;
long long a,b;
long long euclid(long a,long b)
{
int r=a%b;
while(r)a=b,b=r,r=a%b;
return b;
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("esuclid2.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%lld %lld",&a,&b);
printf("%lld\n",euclid(a,b));
}
return 0;
}