how to find hcf in c++
// C++ program to find GCD of two numbers
#include <iostream>
using namespace std;
// Recursive function to return gcd of a and b
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
// Driver program to test above function
int main()
{
int a = 98, b = 56;
cout<<"GCD of "<<a<<" and "<<b<<" is "<<gcd(a, b);
return 0;
}gcd function c++
ll gcd(ll a, ll b)
{
if (b==0)return a;
return gcd(b, a % b);
}gcd function in c++
int gcd(int a, int b)
{
// Everything divides 0
if (a == 0)
return b;
if (b == 0)
return a;
// base case
if (a == b)
return a;
// a is greater
if (a > b)
return gcd(a-b, b);
return gcd(a, b-a);
}gcd 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
