Cod sursa(job #2215258)
| Utilizator | Data | 21 iunie 2018 14:56:59 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gl_a,gl_b;
int euclid(int a, int b){
if(a>b){
if(a%b==0)
return b;
else
return euclid(b,a%b);
}
else if(b>a){
if(b%a==0)
return a;
else
return euclid(a,b%a);
}
}
int main()
{
int t;
fstream f("euclid2.in",ios::in);
fstream g("euclid2.out",ios::out);
f>>t;
while(t>0){
f>>gl_a>>gl_b;
g<<euclid(gl_a,gl_b)<<endl;
t--;
}
f.close();
g.close();
return 0;
}
