Cod sursa(job #1705215)
| Utilizator | Data | 20 mai 2016 02:10:57 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
int euclid(int a, int b){
if (b==0)
return a;
else
return euclid(b, a%b);
}
int main(){
std::ifstream input;
std::ofstream output;
input.open("euclid2.in");
output.open("euclid2.out");
int nr;
input >> nr;
int a,b;
for (int i=0;i<nr;i++){
input>>a>>b;
int rest=euclid(a,b);
output<<rest;
output<<"\n";
}
input.close();
output.close();
return 0;
}