Cod sursa(job #1661505)
Utilizator | Data | 23 martie 2016 22:08:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
std::ifstream in("euclid2.in");
std::ofstream out("euclid2.out");
int cmmdc(int a , int b)
{
return b==0?a:cmmdc(b,a%b);
}
int main()
{
int n, a, b;
in >> n;
while(n--)
{
in >> a >> b;
out << cmmdc(a,b) << '\n';
}
return 0;
}