Introduction - If you have any usage issues, please Google them yourself
738,810,274,445,265 (Figure 1) Figure 1 shows a digital triangle. From the Department of the triangle at the top in the end there are many trails. For each path, the path above and get a few together, your task is to find the largest and. Note: Each step on the path can only come from a number of the next level and in its most recent number of the left or right that that number.