Cod sursa(job #1505265)
Utilizator | Data | 18 octombrie 2015 22:28:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
inline 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;
cin >> t;
while (t--) {
int a, b;
cin >> a >> b;
cout << gcd(a,b) << endl;
}
return 0;
}