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 = 1
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 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 = 1
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+")");
}
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
