Cod sursa(job #1402786)
Utilizator | Data | 26 martie 2015 20:50:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int e(int a, int b)
{
if(b==0)
return a;
else return e(b, a%b);
}
int main()
{
fstream f("euclid2.in", ios::in);
fstream g("euclid2.out", ios::out);
int n;
int a,b;
for(int i = 0; i<n; ++i)
{
f>>a>>b;
g<<e(a,b)<<'\n';
}
}