Cod sursa(job #744176)
Utilizator | Stavarache Petru Eric ericpts | Data | 7 mai 2012 21:52:15 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <iostream>
using namespace std;
int divz(int a,int b)
{
int r = a % b;
while(r)
{
a = b;
b = r;
r = a % b;
}
if(b == 1)return 0;
return b;
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int a,b;
in >> a >> b;
if(a>b) out << divz(a,b);
else out << divz(b,a);
in.close();
out.close();
return 0;
}