#include #define N 15 int isPrime(int num) { int i; //loop counter //it will be 1 when number is not prime int flag=0; for(i=2; i=0; i--) { for ( j=0; j<=i; j++) { if((isPrime(tri[0][0])) != 0){ if (tri[i+1][j] > tri[i+1][j+1]){ tri[i][j] += tri[i+1][j]; }else{ tri[i][j] += tri[i+1][j+1]; } } } } return tri[0][0]; // return the top element which stores the maximum sum } int main() { int tri[N][N] = { {1}, {8,4}, {2,6,9}, {8,5,9,3}}; printf("%d", maxPathSum(tri, 14)); return 0; }