Cod sursa(job #2059712)
Utilizator | Data | 7 noiembrie 2017 15:32:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <iostream>
using namespace std;
long gcd(long a , long b)
{
while (a!=b)
{
if (a>b){
a=a-b;
}
{
if (b>a) { b=b-a; }
}
}
return a;
}
int main()
{
long x;
long y;
cin >> x >>y ;
cout << gcd(x,y) << endl;
}