Cod sursa(job #291745)
Utilizator | Data | 30 martie 2009 12:23:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(long a, long b){
/* while(a!=b)
if(a>b)a=a-b;
else b=b-a;
return a; */
if(!b)return a;
else return euclid(b, a%b);
}
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;
}