Cod sursa(job #2481637)
Utilizator | Data | 27 octombrie 2019 10:18:44 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
if(a%b==0)
{
return b;
}
else
{
return cmmdc(b, a%b);
}
}
int main()
{
int n, a, b;
f>>n;
while(n)
{
f>>a>>b;
g<<cmmdc(a, b)<<endl;
n--;
}
return 0;
}