Problem_018.c

#include <stdio.h>
#include <stdlib.h>

int main(void)
{
	int tree[15][15] = {{75},
						{95, 64},
						{17, 47, 82},
						{18, 35, 87, 10},
						{20, 04, 82, 47, 65},
						{19, 01, 23, 75, 03, 34},
						{88, 02, 77, 73, 07, 63, 67},
						{99, 65, 04, 28, 06, 16, 70, 92},
						{41, 41, 26, 56, 83, 40, 80, 70, 33},
						{41, 48, 72, 33, 47, 32, 37, 16, 94, 29},
						{53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14},
						{70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57},
						{91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48},
						{63, 66, 04, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31},
						{04, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 04, 23}};
						 
	int lines;
	int rows;
	
	for(lines = 0; lines < 15; lines++)
	{
		printf("\n");
		for(rows = 0; rows < 15; rows++)
		{
			printf("Number: %d\n", tree[lines][rows]);
		}
	}
	
	for(lines = 14; lines > 0; lines--)
	{
		for(rows = 0; rows < 14; rows++)
		{
			if(tree[lines][rows] >= tree[lines][rows + 1])
			{
				tree[lines - 1][rows] += tree[lines][rows];
			}
			else
			{
				tree[lines - 1][rows] += tree[lines][rows + 1];
			}
		}
	}
	printf("Result: %d\n", tree[0][0]);
	return 0;
}