Cod sursa(job #291736)
Utilizator | Data | 30 martie 2009 12:08:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream.h>
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(long a, long b){
if(a==b)return a;
if(a>b)return euclid(a-b,b);
else return euclid(a, b-a);
}
int main (){
long n,a,b;
f>>n;
for(long i=0; i<n; i++){
f>>a>>b;
g<<euclid(a,b)<<'\n'; }
f.close();
g.close();
return 0;
}