Cod sursa(job #1450259)
Utilizator | Data | 12 iunie 2015 10:25:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
template <typename F>
F CMMDC(F a, F b)
{
if (b)
return CMMDC(b, a%b);
else
return a;
}
int main()
{
int n, x, y;
f >> n;
for (int i = 1; i <= n; i++)
{
f >> x >> y;
g << CMMDC(x, y) << "\n";
}
}