Cod sursa(job #903719)
Utilizator | Data | 2 martie 2013 17:53:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int cmmdc(int x, int y) {
if (!y) return x;
return cmmdc(y, x%y);
}
int main() {
int n, a, b;
in >> n;
while (n) {
in >> a;
in >> b;
out << cmmdc(a, b) << endl;
}
return 0;
}