Cod sursa(job #1405583)
Utilizator | Data | 29 martie 2015 13:50:46 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
int cmmdc(int a, int b){
if(!b) return a;
return cmmdc(b, a%b);
}
int main(){
using namespace std;
ofstream out("euclid.out");
ifstream in("euclid.in");
int a, b, n;
in>>n;
for(; n!=0 ;n--){
in>>a>>b;
out<<cmmdc(a,b)<<"\n";
}
return 0;
}