/C++/Gcd

Gcd

static int gcd(int a, int b)
    {
      if (b == 0)
        return a;
      return gcd(b, a % b); 
    }

Gcd

int gcd(int a,int b) {
	while (a&&b) a>b?a%=b:b%=a;
	return a+b;
}

Gcd

import math

a = 10
b = 8
answer = math.gcd(10, 8)
print(answer)

GCD

import java.util.Scanner;
public class   Euclid {
    static public void main(String[] argh){
        System.out.print("Enter two numbers: ");
        Scanner input = new Scanner(System.in);
        int a = input.nextInt();
        int b = input.nextInt();
        int TEMP = 0 ;
        int GCD = 0;
        int max = a>b?a:b;
        int min = a<b?a:b;
        while(min!=0){
            TEMP=(max%min);
            GCD = min ;
            min = TEMP;
        }
        System.out.print("("+GCD+")");
    }
}

Gcd

int gcd(int a,int b){
    if(b==0) return a;
    return gcd(b,a%b);
}

Gcd

int gcd(int a, int b) {
    while (b) b ^= a ^= b ^= a %= b;
    return a;
}

Similar codes

2 votes117 views1 answer
C++ wait for user input
C++
1 vote301 views1 answer
Have unique vector after sorting vector
C++
0 vote100 views1 answer
UPARAM(ref)
C++
1 vote113 views1 answer
C++ base constructor
C++
0 vote108 views1 answer
3. The method indexOf, part of the List interface, returns the index of the first occurrence of an object in a List. What does the following code fragment do?
C++
0 vote112 views1 answer
\frac{2}{5}MR^2 typed in c++
C++
3 votes110 views1 answer
Function in struct c++
C++
1 vote144 views1 answer
Login system with c++
C++
1 vote116 views1 answer
Isprime c++
C++
0 vote121 views1 answer
Sort strings by length and by alphabet
C++