Cod sursa(job #421978)
Utilizator | Data | 21 martie 2010 22:32:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
long cmmdc(long a,long b) {
if(a%b==0) return b;
else return cmmdc(b,a%b);
}
int main() {
int T,i;
long m,n;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>T;
for(i=1;i<=T;i++) {
f>>m>>n;
g<<cmmdc(m,n)<<endl;
}
f.close();
g.close();
return 0;
}