Breaking News: Grepper is joining You.com. Read the official announcement!

gcd of two numbers

Add Answer

krishnaa s answered on May 16, 2022 Popularity 10/10 Helpfulness 2/10

answer gcd of two numbers

related what is gcd of two numbers

related gcd of two number

related Program to find GCD or HCF of two numbers c++

related GCD of 2 numbers

gcd of two numbers

Comment

-1

#include <iostream>
using namespace std;
int gcd(int a , int b)
{
    if(a==0)
    return a;
    if(b==0)
    return b;
    if(a==b)
    return a;
    if(a>b)
    {
        return gcd(a-b,b);
    }
    else
    {
        return gcd(a,b-a);
    }
}
int main()
{
    cout<<gcd(18,24);
    return 0;
}

Popularity 10/10 Helpfulness 2/10 Language cpp

Source: Grepper

Tags: c++ numbers

Link to this answer
Share Copy Link

Contributed on May 16 2022

krishnaa s

0 Answers Avg Quality 2/10

Closely Related Answers

what is gcd of two numbers

Comment

#include <iostream>
using namespace std;

int gcd(int a, int b)
{
    int r;
    if(b>a)
        swap(a,b);
    while(b!=0)
    {
        r = a % b;
        a = b;
        b = r;
    }

    return a;
}

int main()
{
    int a, b ;
    cout<<"Enter two numbers: ";
    cin>>a >>b;

    cout<<"GCD = " <<gcd(a,b);

    return 0;
}

Popularity 10/10 Helpfulness 3/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Aug 26 2023

Sleep deprived

0 Answers Avg Quality 2/10

gcd of two number

Comment

#My Python Lectures: https://cutt.ly/python-full-playlist
#Codechef Problem Solution Video: https://cutt.ly/codeChefContestProblemSolution

import math
print("Res =",math.gcd(2, 1))

#Res = 1

Popularity 10/10 Helpfulness 2/10 Language python

Source: youtu.be

Tags: function functio

Link to this answer
Share Copy Link

Contributed on Aug 17 2022

Excited Earthworm

0 Answers Avg Quality 2/10

Program to find GCD or HCF of two numbers c++

Comment

// C++ program to find GCD of two numbers
#include <bits/stdc++.h>
using namespace std;
 
int static dp[1001][1001];
 
// Function to return gcd of a and b
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;
     
    // if a value is already
    // present in dp
    if(dp[a][b] != -1)
        return dp[a][b];
 
    // a is greater
    if (a > b)
        dp[a][b] = gcd(a-b, b);
     
    // b is greater
    else
        dp[a][b] = gcd(a, b-a);
     
    // return dp
    return dp[a][b];
}
 
// Driver program to test above function
int main()
{
    int a = 98, b = 56;
    memset(dp, -1, sizeof(dp));
    cout<<"GCD of "<<a<<" and "<<b<<" is "<<gcd(a, b);
    return 0;
}

Popularity 9/10 Helpfulness 2/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jul 08 2022

Travinth Dayalaeaswaran

0 Answers Avg Quality 2/10

GCD of 2 numbers

Comment

// Iterative Java program to
// implement Stein's Algorithm
import java.io.*;
 
class GFG {
 
    // Function to implement Stein's
    // Algorithm
    static int gcd(int a, int b)
    {
        // GCD(0, b) == b; GCD(a, 0) == a,
        // GCD(0, 0) == 0
        if (a == 0)
            return b;
        if (b == 0)
            return a;
 
        // Finding K, where K is the greatest
        // power of 2 that divides both a and b
        int k;
        for (k = 0; ((a | b) & 1) == 0; ++k)
        {
            a >>= 1;
            b >>= 1;
        }
 
        // Dividing a by 2 until a becomes odd
        while ((a & 1) == 0)
            a >>= 1;
 
        // From here on, 'a' is always odd.
        do
        {
            // If b is even, remove
            // all factor of 2 in b
            while ((b & 1) == 0)
                b >>= 1;
 
            // Now a and b are both odd. Swap
            // if necessary so a <= b, then set
            // b = b - a (which is even)
            if (a > b)
            {
                // Swap u and v.
                int temp = a;
                a = b;
                b = temp;
            }
 
            b = (b - a);
        } while (b != 0);
 
        // restore common factors of 2
        return a << k;
    }
 
    // Driver code
    public static void main(String args[])
    {
        int a = 34, b = 17;
 
        System.out.println("Gcd of given "
                           + "numbers is " + gcd(a, b));
    }
}
 
// This code is contributed by Nikita Tiwari

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: numbers

Link to this answer
Share Copy Link

Contributed on Aug 23 2022

Lokesh Raj

0 Answers Avg Quality 2/10

gcd of two numbers

Contents

More Related Answers

gcd of two numbers

Closely Related Answers

what is gcd of two numbers

gcd of two number

Program to find GCD or HCF of two numbers c++

GCD of 2 numbers

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.