Problem 12

最新推荐文章于 2024-10-05 12:07:50 发布

soulx

最新推荐文章于 2024-10-05 12:07:50 发布

阅读量368

点赞数 1

分类专栏： Euler Project 文章标签： java Java JAVA 欧拉项目算法

本文链接：https://blog.csdn.net/soulx/article/details/8563197

版权

Euler Project 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

欧拉项目

问题10：Highly divisible triangular number

The sequence of triangle numbers is generated by adding the natural numbers. So the 7^th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:

1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...

Let us list the factors of the first seven triangle numbers:

1: 1
3: 1,3
6: 1,2,3,6
10: 1,2,5,10
15: 1,3,5,15
21: 1,3,7,21
28: 1,2,4,7,14,28

We can see that 28 is the first triangle number to have over five divisors.

What is the value of the first triangle number to have over five hundred divisors?

分析

这道题目是找出第一个拥有500除数的三角数。，采用试除法可以得到。

Project Euler 网站的解决方案是采用素数表，效率很高。

解决方案（Java）

package Problem12;

public class HighlyDivisible {

    private static final int divisorsNumbers = 500;
    
    private int number = 1;
    
    public static void main(String[] args){
        HighlyDivisible hd = new HighlyDivisible();
        long startTime = System.currentTimeMillis();   
        hd.compute();
        long endTime = System.currentTimeMillis();       
        System.out.println("Time: "+(endTime-startTime));           
        hd.print();
    }
    
    private void compute(){
        
        int currDivisorsLevel = 1;
        int currDivisorsNumbers = 0;

        while(currDivisorsNumbers<divisorsNumbers){
            currDivisorsLevel++;
            number = number+currDivisorsLevel;//(currDivisorsLevel * (currDivisorsLevel + 1))/2;
            currDivisorsNumbers = getDivisorsNumbers(number);
//            System.out.println(number+":"+currDivisorsNumbers);
        }
        
    }
    
    private void print(){
        System.out.println("Number: "+ number + " is the first triangle number to have over "+divisorsNumbers+" divisors");
    }
    
    private int getDivisorsNumbers(int num){
        int currDivisorsNumbers = 0;
        
        int maxDivisiorNum = (int)Math.sqrt(num);
        
        for(int i=1;i<=maxDivisiorNum;i++){
            if(num%i==0)currDivisorsNumbers += 2;
        }
        
        return currDivisorsNumbers;
    }
    
}