Cod sursa(job #2425546)
Utilizator | Data | 24 mai 2019 21:24:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#inclide <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int euclid(int a, int b)
{
if(a==b)return a;
else{
if(a>b)return euclid(a-b,b);
else return euclid(a,b-a);
}
}
int main()
{
int n;
in>>n;
int a,b;
while(n>0){
out<<euclid(a,b)<<endl;n--;}
return 0;
}