Cod sursa(job #2067253)
Utilizator | Data | 16 noiembrie 2017 02:08:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int x, int y) {
if (!y) return x;
else return cmmdc(y, x%y);
}
int main() {
int t, a, b;
f >> t;
for (; t; --t) {
f >> a >> b;
g << cmmdc(a, b) << "\n";
}
return 0;
}