Cod sursa(job #2230898)
Utilizator | Data | 12 august 2018 11:35:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int cmmdc(int a, int b) {
if(0 < b) {
return cmmdc(b, a % b);
} else {
return a;
}
}
int main() {
int n, a, b;
in >> n;
for(int i = 0; i < n; i++) {
in >> a >> b;
out << cmmdc(a, b)<< "\n";//"\n"
}
return 0;
}