You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below;
- You will start from the top and move downwards to an adjacent number as in below.
- You are only allowed to walk downwards and diagonally.
- You can only walk over NON PRIME NUMBERS.
- You have to reach at the end of the pyramid as much as possible.
- You have to treat your input as pyramid.
Max Sum for Test 1 : 24
Max Sum for Test 2 : 8186
- Take the input file and convert it to a 2D array of ints
- Traverse array for prime numbers and set them to 0
- Calculate the maximum sum possible by comparing each value in the array with the value directly below or below and to the right of it, then adding the greater value of those values to it. If either of those two values are prime (prime numbers are set equal to 0), the value should be eliminated (set to 0) as it could not be walked over.
- Print the maximum sum which is in the first column of the first row of the array.