Cod sursa(job #1175546)
Utilizator | Data | 24 aprilie 2014 20:39:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n, a, b;
int cmmdc(int a, int b)
{
if (!b) return a;
return cmmdc(b, a % b);
}
int main()
{
f >> n;
for(int i = 1; i <= n; ++i)
{
f >> a >> b;
g << cmmdc(a, b) << '\n';
}
return 0;
}