Cod sursa(job #913909)
| Utilizator | Data | 13 martie 2013 20:41:49 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int gcd (long long x, long long y)
{
if (y==0) return x;
else gcd(y,x%y);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
int T,i;
long long a,b,r;
scanf("%d",&T);
for (i=1;i<=T;i++)
{
scanf("%lld %lld", &a, &b);
a=gcd(a,b);
printf("%lld\n",a);
}
fclose(stdin);
fclose(stdout);
return 0;
}
