Cod sursa(job #2632832)
Utilizator | Paraschiv Alexandru-Andrei ParALI | Data | 5 iulie 2020 11:04:30 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
/*int cmmdc(int a, int b)
{
while(b!=0)
{
int r=a%b;
a=b;
b=r;
}
return a;
}*///trebuie recursiv
int cmmdc(int a, int b)
{
if(b==0)
return a;
else
return cmmdc(b,a%b);
}
int main()
{
int n, x, y;
f>>n;
for(int i=1; i<=n; i++)
{
f>>x>>y;
g<<cmmdc(x,y)<<endl;
}
return 0;
}