Cod sursa(job #608395)
Utilizator | Data | 16 august 2011 15:19:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream.h>
#include <iostream.h>
long long T,a,b,i;
int euclid(int x, int y){
if (!y)
return x;
return euclid(y,x%y);
}
int main(){
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>T;
for (i=0;i<T;i++){
f>>a>>b;
g<<euclid(a,b)<<endl;
}
}