第五章第十六题(找出一个整数的因子)(Find the factors of an integer)

第五章第十六题(找出一个整数的因子)(Find the factors of an integer)

  • *5.16(找出一个整数的因子)编写程序,读入一个整数,然后以升序显示它的所有最小因子。例如,若输入的整数是120,那么输出就应该是2,2,2,3,5。
    *5.6 (Find the factors of an integer) Write a program that reads an integer and displays all its smallest factors in an increasing order. For example, if the input integer is 120, the output should be as follows: 2, 2, 2, 3, 5.
  • 参考代码:
package chapter05;

import java.util.Scanner;

public class Code_16 {
    public static void main(String[] args) {
        String factorsResult = "";

        System.out.print("Enter an integer number: ");
        Scanner inputScanner = new Scanner(System.in);
        int number = inputScanner.nextInt();

        for(int i = 2;number != 1;)
        {
            if(number % i == 0)
            {
                number /= i;
                factorsResult += i + ", ";
            }
            else
                i++;
        }
        factorsResult = factorsResult.substring(0,factorsResult.length()-2) + ".";
        System.out.println("All its smallest factors are " + factorsResult);
    }
}

  • 结果显示:
Enter an integer number: 120
All its smallest factors are 2, 2, 2, 3, 5.

Process finished with exit code 0

  • 2
    点赞
  • 5
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值