Cod sursa(job #2916217)
Utilizator | Data | 28 iulie 2022 14:24:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
std::ifstream fin("euclid2.in");
std::ofstream fout("euclid2.out");
int main() {
int number_of_pairs;
fin >> number_of_pairs;
for (int i = 0; i < number_of_pairs; i++)
{
int a;
int b;
fin >> a >> b;
while (b != 0)
{
int r = a % b;
a = b;
b = r;
}
fout << std::endl;
fout << a;
}
return 0;
}