/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

0 vote193 views1 answer
Leetcode fast io c++
C++
0 vote180 views1 answer
2000pp pp play osu std
C++
0 vote183 views1 answer
C++ set comparator
C++
-1 vote185 views2 answers
Balanced parentheses
C++
0 vote169 views1 answer
How to print an array in cpp in single line
C++
0 vote173 views1 answer
What algorithm does bitcoin use
C++
0 vote181 views1 answer
Through map c++
C++
1 vote172 views1 answer
What is time complexity of min_element()
C++
0 vote195 views1 answer
Vector int initialize with increasing numbers
C++
0 vote174 views1 answer
Return the index where maximum element in a vector
C++