Cod sursa(job #2356170)
Utilizator | Data | 26 februarie 2019 15:50:38 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
using namespace std;
using num = unsigned long long;
constexpr num gcd(const int a, const int b)
{
return (b==0)?a:gcd(b,a%b);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
num a,b;
cin >>a>>b;
const num r = gcd(a,b);
if(r == 1)cout<<0;
else cout<<r;
return 0;
}