Cod sursa(job #1670469)
Utilizator | Data | 31 martie 2016 19:15:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("eulcid2.out");
int main()
{
int a,b,mx=0,i,ok=1,m,n;
in>>a>>b;
m=a;
n=b;
if(m>n)
mx=n;
if(m<n)
mx=m;
for(i=mx;i>=1;i-- && ok!=0)
{
if(a%i==0 && b%i==0) ok=0;
if(ok==0)
{out<<i;
break;}
}
return 0;
}