Cod sursa(job #2207749)
Utilizator | Data | 26 mai 2018 17:15:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
return b == 0 ? a : gcd(b, a % b);
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int t;
fin >> t;
for (int i = 1; i <= t; i++) {
int x, y;
fin >> x >> y;
fout << gcd(x, y) << "\n";
}
fin.close();
fout.close();
return 0;
}