gcd function c++
ll gcd(ll a, ll b)
{
if (b==0)return a;
return gcd(b, a % b);
}gcd function c++
ll gcd(ll a, ll b)
{
if (b==0)return a;
return gcd(b, a % b);
}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);
}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 in c++
#include<iostream>
using namespace std;
int euclid_gcd(int a, int b) {
if(a==0 || b==0) return 0;
int dividend = a;
int divisor = b;
while(divisor != 0){
int remainder = dividend%divisor;
dividend = divisor;
divisor = remainder;
}
return dividend;
}
int main()
{
cout<<euclid_gcd(0,7)<<endl;
cout<<euclid_gcd(55,78)<<endl;
cout<<euclid_gcd(105,350)<<endl;
cout<<euclid_gcd(350,105)<<endl;
return 0;
}gcd using cpp
#include <bits/stdc++.h>
using namespace std;
int gcd(int a,int b){
if(a==0){
return b;
}
if(b==0){
return a;
}
if(a==b){
return a;
}
int x=0;
int mx = INT_MIN;
int mi = min(a,b);
for(int i=2;i<=mi;i++){
if(a%i==0 and b%i==0){
mx = max(mx,i);
}
}
return mx;
}
int main() {
int a = 36;
int b = 60;
cout<<gcd(a,b);
}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
