Cod sursa(job #2330892)
Utilizator | Data | 28 ianuarie 2019 22:03:53 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a, int b)
{
if (b == 0)
return a;
return cmmdc(b, a%b);
}
int main()
{
int n,a,b;
ifstream f("euclid.in");
ofstream g("euclid.out");
f >> n;
for (int i = 0; i < n; i++)
{
f >> a;
f >> b;
g << cmmdc(a, b) << endl;
}
return 0;
}