Cod sursa(job #165068)
Utilizator | Data | 25 martie 2008 12:25:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream.h>
int gcf(long a, long b);
int main()
{
long a,b;
ifstream in("cmmdc.in");
in>>a;
in>>b;
in.close();
ofstream out("cmmdc.out");
if(gcf(a,b)==1)out<<0;
else out<<gcf(a,b);
out.close();
return 0;
}
int gcf(long a, long b)
{
if(a%b==0)
return b;
else return gcf(b,a%b);
}