Cod sursa(job #2450034)
Utilizator | Data | 21 august 2019 17:12:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int a, int b) {
if (!b)
return a;
return cmmdc(b, a % b);
}
int main() {
int t, a, b;
fin >> t;
for (int i = 0; i < t; ++i) {
fin >> a >> b;
fout << cmmdc(a, b) << endl;
}
//system("pause");
return 0;
}