Cod sursa(job #151675)
Utilizator | Data | 8 martie 2008 15:04:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
void cmmdc(int a, int b, int &rez);
int main()
{
int n1, n2, divizor;
std::ifstream f1("euclid2.in");
f1>>n1;
f1>>n2;
f1.close();
cmmdc(n1, n2, divizor);
std::ofstream f2("euclid2.out");
f2<<divizor<<"\n";
f2.close();
return 0;
}
void cmmdc(int a, int b, int &rez)
{
int rest=a%b;
while (rest>0)
{
a=b;
b=rest;
rest=a%b;
}
rez=b;
}