Cod sursa(job #263219)
Utilizator | Data | 19 februarie 2009 23:50:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
long gcd(long u, long v){
if (v==0) return u;
else return gcd(v,u%v);
}
int main(){
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
long u, v;
f>>n;
for (int i = 0;i<n;i++){
f>>u>>v;
g<<gcd(u,v)<<endl;
}
f.close();
g.close();
return 0;
}