Answers for "gcd algorithm"

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 algorithm

function gcd(a, b)
    if b = 0
        return a
    else
        return gcd(b, a mod b)

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;
}

gcd program in c

#include <stdio.h>
int main()
{
    int t, n1, n2, gcd; 
    scanf("%d", &t); // Test Case Input
    while (t--)
    {
        scanf("%d %d", &n1, &n2);// Taking numbers input

        if (n2 > n1)
        {

            gcd = n1;
            n1 = n2;
            n2 = gcd;
        }
        while (n1 % n2 != 0)
        {
            gcd = n2;
            n2 = n1 % n2;
            n1 = gcd; 
        }
        // n2 is our gcd
        printf("GCD: %d\n", n2);
    }
    return 0;
}

euclid algorithm

def MCD(a,b):
    while b != 0:
        a, b = b, a % b
    return a