Cod sursa(job #1778422)
Utilizator | Data | 13 octombrie 2016 19:32:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(int nr1,int nr2){
if(nr2==0)
return (nr1);
return euclid(nr2,nr1%nr2);
}
int main(){
int contor;
int nr1;
int nr2;
f >> contor;
while(contor > 0){
f>>nr1>>nr2;
g<<euclid(nr1,nr2)<<"\n";
--contor;
}
return (0);
}