Cod sursa(job #2640386)
Utilizator | Data | 6 august 2020 12:09:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int a, int b) {
if (a == b)
return a;
if (a > b)
cmmdc(a - b, b);
else
cmmdc(a, b - a);
}
int main() {
int n;
fin >> n;
for (int i = 1; i <= n; ++i) {
int a, b;
fin >> a >> b;
fout << cmmdc(a, b) << "\n";
}
}