gcd of two numbers c++
// gcd function definition below:
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int a = 105, b = 30;
cout<<"GCD of "<< a <<" and "<< b <<" is "<< gcd(a, b);
// output = "GCD of 105 and 30 is 15";gcd in c++
#include<iostream>
using namespace std;
long long gcd(long long a, long long b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int main()
{
long long a,b;
cin>>a>>b;
cout<<gcd(a,b);
}how to find gcd of two numbers in c++
#include<bits/stdc++.h>
using namespace std;
long long UCLN(long long a,long long b)
{
long long r;
while (b!=0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
long long a, b;
cout<< "enter: ";
cin>> a;
cout<< "enter: ";
cin >>b;
cout<<UCLN(a,b)<<endl;
return 0;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
