Cod sursa(job #154559)
Utilizator | Data | 11 martie 2008 11:59:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
long euclid(long x;long y){
if(y==0) return x;
return euclid(y,x%y);
}
int main(){
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long t;
f>>t;
for(long i=q;i<=t;i++){
long a,b;
f>>a>>b;
g<<euclid(a,b);
}
f.close();
g.close();
return 0;
}