Cod sursa(job #772151)
Utilizator | Data | 28 iulie 2012 14:05:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
using namespace std;
int n, a, b;
int cmmdc(int a, int b) {
return (b == 0) ? a : cmmdc(b, a % b);
}
int main()
{
freopen ("euclid2.in", "r", stdin);
freopen ("euclid2.out", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d %d", &a, &b);
printf("%d\n", cmmdc(a, b));
}
}