Cod sursa(job #1442410)
Utilizator | Data | 25 mai 2015 12:44:32 | |
---|---|---|---|
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 f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc (int a, int b) {
if (!b) return a;
else return cmmdc(b, a % b);
}
int main()
{
int n;
f >> n;
for (int i = 1; i <= n; ++i) {
int x, y;
f >> x >> y;
g << cmmdc(x, y) << "\n";
}
return 0;
}