• 欢迎访问开心洋葱网站,在线教程,推荐使用最新版火狐浏览器和Chrome浏览器访问本网站,欢迎加入开心洋葱 QQ群
  • 为方便开心洋葱网用户,开心洋葱官网已经开启复制功能!
  • 欢迎访问开心洋葱网站,手机也能访问哦~欢迎加入开心洋葱多维思维学习平台 QQ群
  • 如果您觉得本站非常有看点,那么赶紧使用Ctrl+D 收藏开心洋葱吧~~~~~~~~~~~~~!
  • 由于近期流量激增,小站的ECS没能经的起亲们的访问,本站依然没有盈利,如果各位看如果觉着文字不错,还请看官给小站打个赏~~~~~~~~~~~~~!

根据给定的数字查找其因数的高效C++代码

PHP 水墨上仙 1569次浏览 0个评论

根据给定的数字查找其因数的高效C++代码

//Algorithm derived from the method described here:
//http://mathschallenge.net/index.php?section=faq&ref=number/number_of_divisors
int mathTools::numFactors(unsigned long long number){
    if(number < 2){
        return 1;
    }
    //Answer starts at one because all numbers can be divided by 1
    int answer = 1;
    int counter = 0;
	//Adds up the number of times divisible by 2
    while(number % 2 == 0){
        number = number / 2;
        counter++;
    }
    answer = answer * (counter + 1);
    counter = 0;
	//Gets all other multiples of the number except possibly the last
    for(unsigned long long i = 3; i < ceil(sqrt(number)) + 1; i++){
        while(number % i == 0){
            number = number / i;
            counter++;
        }
        answer = answer * (counter + 1);
        counter = 0;
    }
	//If the last number is not a square this will account for it.
    if(ceil(sqrt(number) != floor(sqrt(number)))){
            counter++;
    }
    answer = answer * (counter + 1);
    return answer;
}


开心洋葱 , 版权所有丨如未注明 , 均为原创丨未经授权请勿修改 , 转载请注明根据给定的数字查找其因数的高效C++代码
喜欢 (0)

您必须 登录 才能发表评论!

加载中……