Cod sursa(job #2751565)
Utilizator | Data | 15 mai 2021 11:14:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int euclid(int a, int b) {
while (a != b) {
if (a > b)
a = a - b;
else
b = b - a;
return a;
}
}
int main() {
int T, a, b;
fin >> T;
for (int i = 1; i <= T; i++ ) {
fin >> a >> b;
fout << euclid(a, b) << endl;
}
return 0;
}