Cod sursa(job #2494200)
Utilizator | Data | 17 noiembrie 2019 15:12:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
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(!b)
return a;
else
return cmmdc(b,a%b);
}
int main()
{
int n,a,b,i;
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
f.close();
g.close();
return 0;
}