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

3 votes329 views2 answers
Python turtle text generator
Python
9 votes358 views5 answers
Get dummies pandas
Python
0 vote290 views1 answer
Python loop opening file from directory
Python
0 vote380 views1 answer
Using a generic exception block
Python
42 votes280 views6 answers
Python comment
Python
0 vote283 views1 answer
Python list to sublists
Python
1 vote247 views1 answer
Python comparison operators overloading
Python
0 vote296 views1 answer
Django today date in template
Python
0 vote301 views1 answer
Python tuple multiply sequence
Python
4 votes314 views1 answer
Change type of array python
Python