Cod sursa(job #2213984)
Utilizator | Data | 18 iunie 2018 11:01:44 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
ios::sync_with_stdio(false);
int T;
in >> T;
int a, b;
while (T--) {
in >> a >> b;
out << gcd(a, b) << endl;
}
in.close();
out.close();
return 0;
}