Cod sursa(job #1185892)
Utilizator | Data | 17 mai 2014 10:57:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b) {
if (b==0) {
return a;
} else {
return cmmdc(b, a % b);
}
}
int main()
{
int t, a, b;
f >> t;
while(t--) {
f >> a >> b;
g << cmmdc(a, b) << '\n';
}
return 0;
}