Cod sursa(job #2756643)
Utilizator | Data | 2 iunie 2021 10:37:44 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
using namespace std;
int _gcd(int a, int b) {
if (!b)
return a;
return _gcd(b, a % b);
}
int main()
{
freopen("euclid2.in", "r" ,stdin);
freopen("euclid2.out", "w", stdout);
int N;
scanf("%d", &N);
for (int i = 0; i < N; ++i) {
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", _gcd(a, b));
}
return 0;
}