博客
关于我
java 牛客:因子个数
阅读量:749 次
发布时间:2019-03-22

本文共 2746 字,大约阅读时间需要 9 分钟。

To solve this problem, we need to determine the number of factors for each given positive integer. The solution involves understanding the prime factorization of a number and using it to compute the total number of factors.

Approach

The approach can be broken down into the following steps:

  • Prime Factorization: Decompose the given number into its prime factors. For example, the number 36 can be decomposed into (2^2 \times 3^2).

  • Exponent Tracking: For each prime factor, determine its exponent in the factorization. For instance, in the case of 36, the exponent of 2 is 2, and the exponent of 3 is also 2.

  • Calculate Factors: The total number of factors of a number can be found by taking the product of each prime factor's exponent incremented by one. For example, using the prime factors of 36, the total number of factors is ((2+1) \times (2+1) = 9).

  • Efficient Looping: Use efficient looping techniques to iterate through potential factors, and stop early when further division isn't possible. This optimization prevents unnecessary computations.

  • Solution Code

    import java.util.Scanner;public class Main {    public static void main(String[] args) {        Scanner scanner = new Scanner(System.in);        while (scanner.hasNextInt()) {            int n = scanner.nextInt();            System.out.println(countFactors(n));        }    }    private static int countFactors(int n) {        if (n <= 1) {            return 1;        }        int factors = 1;        for (int i = 2; i * i <= n; ) {            if (n % i == 0) {                int exponent = 0;                while (n % i == 0) {                    exponent++;                    n /= i;                }                factors *= (exponent + 1);            } else {                i++;            }        }        if (n > 1) {            factors *= 2;        }        return factors;    }}

    Explanation

  • Reading Input: The code reads each integer from the standard input.
  • Handling Special Cases: If the input number is 1, it directly returns 1 as it is the only factor.
  • Prime Factorization Loop: The loop iterates from 2 up to the square root of the number. For each potential factor, it checks if it divides the number. If it does, it counts how many times it divides (the exponent) and then divides the number by this factor until it no longer can.
  • Updating Factors Count: The number of factors is updated by multiplying the product of each exponent incremented by one.
  • Remaining Prime Check: If after processing all factors up to the square root, the remaining number is greater than 1, it means it is a prime factor itself, contributing one more factor.
  • This approach efficiently computes the number of factors for each positive integer, ensuring correct and optimal results.

    转载地址:http://nvewk.baihongyu.com/

    你可能感兴趣的文章
    MYSQL:基础——触发器
    查看>>
    Mysql:连接报错“closing inbound before receiving peer‘s close_notify”
    查看>>
    mysqlbinlog报错unknown variable ‘default-character-set=utf8mb4‘
    查看>>
    mysqldump 参数--lock-tables浅析
    查看>>
    mysqldump 导出中文乱码
    查看>>
    mysqldump 导出数据库中每张表的前n条
    查看>>
    mysqldump: Got error: 1044: Access denied for user ‘xx’@’xx’ to database ‘xx’ when using LOCK TABLES
    查看>>
    Mysqldump参数大全(参数来源于mysql5.5.19源码)
    查看>>
    mysqldump备份时忽略某些表
    查看>>
    mysqldump实现数据备份及灾难恢复
    查看>>
    mysqldump数据库备份无法进行操作只能查询 --single-transaction
    查看>>
    mysqldump的一些用法
    查看>>
    mysqli
    查看>>
    MySQLIntegrityConstraintViolationException异常处理
    查看>>
    mysqlreport分析工具详解
    查看>>
    MySQLSyntaxErrorException: Unknown error 1146和SQLSyntaxErrorException: Unknown error 1146
    查看>>
    Mysql_Postgresql中_geometry数据操作_st_astext_GeomFromEWKT函数_在java中转换geometry的16进制数据---PostgreSQL工作笔记007
    查看>>
    mysql_real_connect 参数注意
    查看>>
    mysql_secure_installation初始化数据库报Access denied
    查看>>
    MySQL_西安11月销售昨日未上架的产品_20161212
    查看>>