Cod sursa(job #154572)
| Utilizator |  Dragos Oana dragosmihai |
Data | 11 martie 2008 12:06:13 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream.h>
//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=1;i<=t;i++){
long a,b;
f>>a>>b;
g<<euclid(a,b)<<endl;
}
f.close();
g.close();
return 0;
}