Cod sursa(job #547158)
Utilizator | Horia Cretescu ELHoria | Data | 5 martie 2011 22:16:20 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<cstdio>
long GCD(long a, long b)
{
if (!b) return a;
return GCD(b,a%b);
}
int main()
{int n,x,y;
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;++i)
{
scanf("%d%d",&x,&y);
printf("%d \n",GCD(x,y));
}
}