Cod sursa(job #3288316)
Utilizator | Data | 21 martie 2025 14:31:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
std::ifstream fin("euclid2.in");
std::ofstream fout("euclid2.out");
int GCD(int first, int second)
{
while (second != 0)
{
int temp = second;
second = first % second;
first = temp;
}
return first;
}
int main()
{
int cases;
fin >> cases;
int first, second;
for (int i = 0; i < cases; i++)
{
fin >> first >> second;
fout << GCD(first, second) << "\n";
cases -= 1;
}
}