Cod sursa(job #2535574)
Utilizator | Data | 1 februarie 2020 01:38:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int greatestCommonDivisor(int a, int b)
{
if (!b)
return a;
return greatestCommonDivisor(b, a % b);
}
int T, A, B;
int main()
{
fin >> T;
for ( ; T; --T)
{
fin >> A >> B;
fout << greatestCommonDivisor(A, B) << endl;
}
return 0;
}