Cod sursa(job #2431376)
Utilizator | Data | 19 iunie 2019 09:49:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
if (b == 0)
return a;
else
return cmmdc(b, a % b);
}
int main()
{
int n, x, y;
f >> n;
for (int i = 1; i <= n; i++)
{
f >> x >> y;
g << cmmdc(x, y) << '\n';
}
return 0;
}