Cod sursa(job #2216210)
| Utilizator |  Ana-Maria Cretan [email protected] |
Data | 25 iunie 2018 21:34:21 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long euclid(long a, long b)
{
if (b == 0)
return a;
else
return euclid(b, a%b);
}
int main()
{
int n;
long a, b;
f >> n;
for (int i = 1; i <= n; i++)
{
f >> a;
f >> b;
g << euclid(a, b) << endl;
}
}