Projec Euler
zycsu
这个作者很懒,什么都没留下…
展开
-
Project Euler 15: Routes through a 20×20 grid
The problem description in Problem 15 of Project Euler contains a figure, which I wont copy, so go ahead an read the full description at the Project Euler site. The problem can be understood wit转载 2013-08-18 23:18:22 · 699 阅读 · 0 评论 -
Project Euler 16: Power digit sum.
215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.What is the sum of the digits of the number 21000? 这个问题主要的问题是解决大数据存储。当一个节点的数据于某个值时便增加一个节点来存储就好像进位一样。 例如2^10=1024则在第一个节点存储24然后新建一个节点用来存转载 2013-08-19 23:21:31 · 931 阅读 · 0 评论 -
Maximum path sum I Problem 18
#include using namespace std; int main() { int data[15][15] = { {75}, {95,64}, {17,47,82}, {18,35,87,10}, {20,4,82,47,65}, {19,1,23,75,3,34},原创 2013-10-23 21:07:07 · 620 阅读 · 0 评论 -
Project Euler problem19
You are given the following information, but you may prefer to do some research for yourself. 1 Jan 1900 was a Monday. Thirty days has September, April, June and November. All the rest have th原创 2013-11-15 21:40:59 · 499 阅读 · 0 评论 -
problem20
n! means n × (n − 1) × ... × 3 × 2 × 1 For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800, and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27. Find the sum of原创 2013-11-16 20:03:54 · 447 阅读 · 0 评论 -
Project Euler Problem 21
Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b a原创 2013-12-01 16:29:10 · 563 阅读 · 0 评论