Cod sursa(job #813022)
Utilizator | Data | 14 noiembrie 2012 20:45:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<stdio.h>
long n,m,p,i,k;
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&k);
for(i=1;i<=k;++i)
{
scanf("%ld%ld",&n,&m);
while(m>0)
{
p=n%m;
n=m;
m=p;
}
printf("%ld\n",n);
}
return 0;
}