Cod sursa(job #466465)
Utilizator | Data | 26 iunie 2010 18:03:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
int T, A, B;
int CMMDC (int a, int b) {
if (a % b)
return CMMDC (b, a % b);
else
return b;
}
int main () {
freopen ("euclid2.in", "r", stdin);
freopen ("euclid2.out", "w", stdout);
scanf ("%d", &T);
for (int i = 0; i < T; ++i) {
scanf ("%d%d", &A, &B);
printf ("%d\n", CMMDC(A, B));
}
return 0;
}