Cod sursa(job #1743462)
Utilizator | Data | 18 august 2016 10:55:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#define in "euclid2.in"
#define out "euclid2.out"
using namespace std;
int t, a, b;
int gcd(const int &x, const int &y)
{
if(x == 0) return y;
return gcd(y%x, x);
}
int main()
{
freopen(in, "r", stdin);
freopen(out, "w", stdout);
scanf("%d", &t);
for( ; t; --t)
{
scanf("%d %d", &a, &b);
printf("%d\n", gcd(a, b));
}
return 0;
}