Cod sursa(job #2449478)
Utilizator | Data | 19 august 2019 21:31:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int gcd(int a, int b) {
while (b) {
swap(a, b);
b %= a;
}
return a;
}
int main() {
freopen ("euclid2.in", "r", stdin);
freopen ("euclid2.out", "w", stdout);
int t;
scanf("%d", &t);
while (t--) {
int a, b;
scanf("%d %d", &a, &b);
printf("%d\n", gcd(a, b));
}
return 0;
}