求两个数的最大公因数

/*
Enter two integer: 33 100
They haven't any common divizor.
Enter two integer: 100 330
This greatest common divisor for 100 and 330 is 10
Enter two integer: 222 123
This greatest common divisor for 222 and 123 is 3
*/

import java.util.Scanner;

public class GreatestCommonDivisorMethod {
  public static void main(String[] args) {
    Scanner input = new Scanner(System.in);

    for(;;) {
      System.out.print("Enter two integer: ");
      int n1 = input.nextInt();
      int n2 = input.nextInt();
      int greatestCommonDivisor = Gcd(n1, n2);

      if(greatestCommonDivisor == 0)
        System.out.println("They haven't any common divizor.");
      else
        System.out.println("This greatest common divisor for " + n1 +
                        " and " + n2 + " is " + greatestCommonDivisor);
    }
  }

  public static int Gcd(int n1, int n2) {
    int gcd = 0;
    int k = 2;

    while (n1 >= k && n2 >= k) {
        if (n1 % k == 0 && n2 % k == 0)
          gcd = k;
        k++;
    }

    return gcd;
  }
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值