Scribd Logo
Upload

Welcome to Scribd!

  • GCD

    Uploaded by

    j0ntj2ivjy
    7 views1 page
    This Java program uses a scanner to input two integers from the user. It then finds the greatest common divisor (GCD) of the two numbers using an algorithm that repeatedly takes the remainder of dividing the larger number by the smaller number, with the smaller number becoming the new larger number when the remainder is not zero. Finally, it prints out the GCD.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This Java program uses a scanner to input two integers from the user. It then finds the greatest common divisor (GCD) of the two numbers using an algorithm that repeatedly takes the remainder of dividing the larger number by the smaller number, with the smaller number becoming the new larger number when the remainder is not zero. Finally, it prints out the GCD.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views1 page

    GCD

    Uploaded by

    j0ntj2ivjy
    This Java program uses a scanner to input two integers from the user. It then finds the greatest common divisor (GCD) of the two numbers using an algorithm that repeatedly takes the remainder of dividing the larger number by the smaller number, with the smaller number becoming the new larger number when the remainder is not zero. Finally, it prints out the GCD.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    import java.util.

    *;
    import java.io.*;

    class GCDProgram
    {
    public void main( )throws IOException
    {
    int a, b, gcd = 1;
    Scanner sc = new Scanner(System.in);

    System.out.print("Enter a=");
    a = sc.nextInt();
    System.out.print("Enter b=");
    b = sc.nextInt();

    int min, max;


    min = a;
    if (min > b)
    {
    min = b;
    max = a;
    }
    else
    {
    min = a;
    max = b;
    }
    while (max > min)
    {
    int r = max % min;
    if (r == 0)
    {
    gcd = min;
    break;
    }
    else
    {
    max = min;
    min = r;
    }
    }
    System.out.println("GCD=" + gcd);
    }
    }

    You might also like