Cod sursa(job #927365)
Utilizator | Alexandru Mihai Maftei vercas | Data | 25 martie 2013 19:13:55 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
using namespace std;
int T, res;
void Euclid(int a, int b)
{
if (!b)
{
res = a;
return;
}
Euclid(b, a % b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
int a, b;
for (int i = 0; i < T; i++)
{
scanf("%d %d", &a, &b);
Euclid(a, b)
printf("%d\n", res);
}
return 0;
}