Cod sursa(job #2193723)
Utilizator | Data | 11 aprilie 2018 10:44:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, a, b;
int cmmdc(int a, int b)
{
if(!b)
return a;
return cmmdc(b, a % b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
cin >> n;
for(int i = 0; i < n; ++i)
{
f >> a >> b;
g << cmmdc(a, b) << "\n";
}
f.close();
g.close();
}