Cod sursa(job #1042059)
Utilizator | Data | 26 noiembrie 2013 15:43:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int GCD(int a, int b)
{
if (b == 0) return a;
return GCD(b, a % b);
}
int main(int argc, char ** argv)
{
int T, A, B;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d\n", &T);
for(; T; T--) {
scanf("%d %d", &A, &B);
cout << GCD(A, B);
}
return 0;
}