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

Python Program to Find HCF or GCD

Jinn world answered on July 8, 2022 Popularity 3/10 Helpfulness 3/10

answer Python Program to Find HCF or GCD

related Program to find GCD or HCF of two numbers python

Python Program to Find HCF or GCD

Comment

# Python program to find H.C.F of two numbers

# define a function
def compute_hcf(x, y):

# choose the smaller number
    if x > y:
        smaller = y
    else:
        smaller = x
    for i in range(1, smaller+1):
        if((x % i == 0) and (y % i == 0)):
            hcf = i 
    return hcf

num1 = 54 
num2 = 24

print("The H.C.F. is", compute_hcf(num1, num2))

Popularity 3/10 Helpfulness 3/10 Language python

Source: www.programiz.com

Tags: find python

Link to this answer
Share Copy Link

Contributed on Jul 26 2022

Jinn world

0 Answers Avg Quality 2/10

Closely Related Answers

Program to find GCD or HCF of two numbers python

Comment

# function to return gcd of a and b
 
# Taking the matrix as globally
dp = [[-1 for i in range(1001)] for j in range(1001)]
 
def gcd(a,b):
     
    # Everything divides 0
    if (a == 0):
        return b
    if (b == 0):
        return a
 
    # base case
    if (a == b):
        return a
     
    if(dp[a][b] != -1):
        return dp[a][b]
         
    # a is greater
    if (a > b):
        dp[a][b] = gcd(a-b, b)
    else:
        dp[a][b] = gcd(a, b-a)
         
    return dp[a][b]
 
# Driver program to test above function
a = 98
b = 56
if(gcd(a, b)):
    print('GCD of', a, 'and', b, 'is', gcd(a, b))
else:
    print('not found')
 
# This code is contributed by Samim Hossain Mondal.

Popularity 9/10 Helpfulness 4/10 Language python

Source: www.geeksforgeeks.org

Tags: find

Link to this answer
Share Copy Link

Contributed on Jul 08 2022

Travinth Dayalaeaswaran

0 Answers Avg Quality 2/10

Program to find GCD or HCF of two numbers python

Comment

// Java program to find GCD of two numbers
import java.util.*;
public class GFG
{
    static int [][]dp = new int[1001][1001];
   
    // Recursive function to return gcd of a and b
    static 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 method
    public static void main(String[] args)
    {
        for(int i = 0; i < 1001; i++) {
            for(int j = 0; j < 1001; j++) {
                dp[i][j] = -1;
            }
        }
        int a = 98, b = 56;
        System.out.println("GCD of " + a +" and " + b + " is " + gcd(a, b));
    }
}
 
// This code is contributed by Samim Hossain Mondal.

Popularity 8/10 Helpfulness 1/10 Language python

Source: www.geeksforgeeks.org

Tags: find numbers

Link to this answer
Share Copy Link

Contributed on Jul 08 2022

Travinth Dayalaeaswaran

0 Answers Avg Quality 2/10

Python Program to Find HCF or GCD

Contents

More Related Answers

Python Program to Find HCF or GCD

Closely Related Answers

Program to find GCD or HCF of two numbers python

Program to find GCD or HCF of two numbers python

Grepper

Documentation

Social

Legal

Contact

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