Cod sursa(job #674834)
Utilizator | Data | 6 februarie 2012 19:54:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int euclid(int x, int y)
{
if (y==0) return x;
else return (y, x%y);
}
int main()
{
int x,y;
f>>x>>y;
if (x>=y)
g<<euclid(x,y);
else g<<euclid(y,x);
return 0;
}