Cod sursa(job #2354043)
Utilizator | Data | 24 februarie 2019 20:18:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
inline int gcd(int a, int b) {
int r = 0;
while(b) {
int r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int t, a, b;
scanf("%d", &t);
for(int i = 1;i <= t;i++) {
scanf("%d%d", &a, &b);
printf("%d\n", gcd(a, b));
}
return 0;
}