euler67.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

#include <stdio.h>

int max(int a, int b)
{
	if (a > b)
		return a;
	else
		return b;
}

int main()
{
	int triangle[100][100];
	int sol[100][100];
	int i, j, n, a;

	n = 0;
	while (scanf("%d", &a)!=EOF) {
		triangle[n][0] = a;
		for (i = 1; i <= n; i++)
			scanf("%d", &triangle[n][i]);
		n++;
	}

	for (i = 0; i < n; i++)
		sol[n-1][i] = triangle[n-1][i];

	for (i = n-2; i >= 0; i--) {
		for (j = 0; j <= i; j++) {
			sol[i][j] = triangle[i][j] + max(sol[i+1][j], sol[i+1][j+1]);
		}
	}

	printf("%d\n", sol[0][0]);
}