Cod sursa(job #1380172)
Utilizator | Data | 6 martie 2015 22:39:21 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if (b > 0) return gcd(b, a % b);
else return a;
}
int main()
{
int a, b;
ifstream f("cmmdc.in");
ofstream g("cmmdc.out");
f >> a >> b;
int ans = gcd(a, b);
ans = min(ans, 30000);
if (ans == 1) ans = 0;
g << ans;
f.close();
g.close();
return 0;
}