Cod sursa(job #706437)
Utilizator | Data | 5 martie 2012 19:30:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <cstdio>
long euclid(long a,long b)
{
long r=a%b;
while(r)
{
a=b;
b=r;
r=a%b;
}
return b;
}
int main()
{
freopen("euclid2.in","rt",stdin);
freopen("euclid2.out","wt",stdout);
long a,b,n;
scanf("%ld",&n);
for(long i=1;i<=n;i++)
{
scanf("%ld %ld",&a,&b);
euclid(a,b);
}
printf("%ld\n",b);
return 0;
}