Cod sursa(job #2213986)
Utilizator | Data | 18 iunie 2018 11:09:14 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <cstdio>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
ios::sync_with_stdio(false);
int T;
scanf("%d", &T);
int a, b;
while (T--) {
scanf("%d %d", &a, &b);
printf("%d\n", gcd(a, b));
}
return 0;
}