加载中
Project Euler Problem 48 - 求大数的模

获取大数 1^1 + 2^2 + ... + 1000^1000 的最后10个数字,大数求模

Project Euler Problem 387 - Harshad Numbers - 深度优先

Find the sum of the strong, right truncatable Harshad primes less than 10^14

Project Euler Problem 80-高精度开方-牛顿逼近法

It is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite without any repeati...

Project Euler Problem 75

It turns out that 12 cm is the smallest length of wire that can be bent to form an integer sided right angle triangle in exactly one way, but there are many more examples. 12 cm...

Project Euler Problem 76-整数分拆

It is possible to write five as a sum in exactly six different ways: 4 + 1 3 + 2 3 + 1 + 1 2 + 2 + 1 2 + 1 + 1 + 1 1 + 1 + 1 + 1 + 1 How many different ways can one hundred be w...

没有更多内容

加载失败,请刷新页面

返回顶部
顶部