Cod sursa(job #2495663)
Utilizator | Data | 19 noiembrie 2019 18:44:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
if(!b)
return a;
else
return cmmdc(b, a % b);
}
int main()
{
int a , b, n;
f >> n;
for(int i = 0; i < n; i++)
{
f >> a >> b;
g << cmmdc(a, b) << "\n";
}
}