Cod sursa(job #3288308)
Utilizator | Data | 21 martie 2025 14:00:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
std::ifstream fin("euclid2.in");
std::ofstream fout("euclid2.out");
int GCD(int first, int second)
{
if (first == 0 || second == 0)
return std::max(first, second);
return GCD(second, first % second);
}
int main()
{
int cases;
fin >> cases;
int first, second;
while (cases)
{
fin >> first >> second;
fout << GCD(first, second) << "\n";
cases -= 1;
}
}