Cod sursa(job #242243)
| Utilizator | Data | 11 ianuarie 2009 11:38:16 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
#include <math.h>
long a, b, t, i;
inline long long cmmdc(long long a, long long b) {
long long r;
while (b) {
r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
for (scanf("%ld", &t); t--; ) {
scanf("%lld %lld", &a, &b);
printf("%lld\n", cmmdc(a, b));
}
return 0;
}
