Cod sursa(job #2295149)
Utilizator | Data | 3 decembrie 2018 11:10:46 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
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);
int T, a, b;
cin >> T;
for(int i = 0; i < T; ++i){
cin >> a >> b;
cout << gcd(a, b) << "\n";
}
return 0;
}