Cod sursa(job #1497562)
Utilizator | Data | 6 octombrie 2015 22:46:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
using namespace std;
int tests, t, A, B;
int gcd(int a, int b) {
int t = 0;
while (b) {
t = b;
b = a % b;
a = t;
}
return a;
}
int main() {
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
t = 0;
scanf("%d", &tests);
while (t++ < tests) {
scanf("%d %d", &A, &B);
printf("%d\n", gcd(A, B));
}
return 0;
}