Cod sursa(job #583144)
Utilizator | Data | 18 aprilie 2011 11:11:19 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<cstdio>
int main()
{
int n,j,d,i,p,q,r;
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d\n",&n);
for (j=1;j<=n;j++) {
scanf("%d %d\n",&p,&q);
if (p>q) d=p; else d=q;
if (p<q) i=p; else i=q;
r=d % i;
while (r!=0) {
d=i;
i=r;
r=d % i;
}
printf("%d\n",i);
}
return 0;
}