Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

Β 

History

History
History
32 lines (24 loc) Β· 609 Bytes

File metadata and controls

32 lines (24 loc) Β· 609 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
package Lecture2_1;
import java.util.Scanner;
public class GCD {
public static void main(String[] gcdArguments){
Scanner sc = new Scanner(System.in);
System.out.println("Enter two numbers: ");
int num1 = sc.nextInt();
int num2 = sc.nextInt();
int divisor, dividend = 0;
if (num1 < num2){
divisor = num1;
dividend = num2;
}else{
divisor = num2;
dividend = num1;
}
while(dividend % divisor != 0){
int remainder = dividend % divisor;
dividend = divisor;
divisor = remainder;
}
System.out.println("GCD of "+num1+ " and "+num2+ " is: "+divisor);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.