Problem 005

欧拉计划----https://projecteuler.net/

---

 

最小倍数

2520是最小的能够被1到10整除的数。

最小的能够被1到20整除的正数是多少？

 

public class Problem5 {
    
    static long cal() {
        int [] a= {2,3,5,7,11,13,17,19};
        long s=0;
        out:
        while(true) {
            s++;
            for (int i = 0; i<=a.length-1; i++) {
                if(s%a[i]!=0) {
                    continue out;
                }
            }
            return s;
        }
    }

    public static void main(String[] args) {
        long start = System.currentTimeMillis();
        System.out.println(cal());
        long end = System.currentTimeMillis();
        System.out.println("runtime:" + (end - start));
    }

}

 

转载于:https://www.cnblogs.com/Alice-Thinker/p/8421516.html