Cod sursa(job #2759766)
Utilizator | Data | 20 iunie 2021 13:04:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <string>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if (!b) return a;
return gcd(b, a % b);
}
int main() {
int T, a, b;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
for (scanf("%d", &T); T; --T) {
scanf("%d %d", &a, &b);
printf("%d\n", gcd(a, b));
}
return 0;
}