Cod sursa(job #2411954)
Utilizator | Data | 21 aprilie 2019 14:42:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a, int b)
{
if(b == 0)
return a;
else
return cmmdc(b, a % b);
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T, a, b, r;
in >> T;
for(int i = 1; i <= T; i++)
{
in >> a >> b;
out << cmmdc(a, b) << endl;
}
in.close();
out.close();
return 0;
}