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 vote268 views2 answers
Java or cpp
Java
0 vote264 views1 answer
Java display form
Java
0 vote238 views1 answer
Jtable get get row
Java
19 votes258 views4 answers
Exception e in java
Java
3 votes256 views3 answers
Java tutorial
Java
0 vote301 views2 answers
Hackerearth test
Java
-1 vote284 views1 answer
Java, how to find the most repeated character
Java
0 vote285 views1 answer
Variable is multiple of 3
Java
1 vote259 views1 answer
Build priority queue
Java
1 vote267 views1 answer
Min value map
Java