Cod sursa(job #955401)
Utilizator | Data | 31 mai 2013 18:57:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
int x1,x2,p;
int CMMDC(int a, int b)
{
if(!b) return a;
else return CMMDC(b,a%b);
}
int main()
{
ifstream f("cmmdc.in");
ofstream g("cmmdc.out");
f>>x1>>x2;
p=CMMDC(x1,x2);
if(p==1) g<<0;
else g<<p;
return 0;
}