Cod sursa(job #813428)
Utilizator | Data | 15 noiembrie 2012 15:29:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <stdio.h>
int main ()
{
freopen ("euclid2.in","r" ,stdin);
freopen ("euclid2.out","r" ,stdout);
long n,m,p,i,k;
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;
}