Cod sursa(job #249851)
Utilizator | Data | 29 ianuarie 2009 13:36:42 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int n, a, b;
int euclid(int a, int b)
{ if (b==0) return a;
else return euclid(b, a%b);
}
int main(void)
{ ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
f >> n;
for (;n;--n)
{ f >> a >> b;
g << euclid(a, b) << endl;
}
return 0;
}