Oh boy, this is interesting. Would love to see CEans cracking this one!

Shall move it to front page, soon.

Hey Sriram,

Check this. This program does basically what you want.
Reply back & I can add support for error handling and INPUT.txt & OUTPUT.txt stuff.

#include <stdio.h>
#include<conio.h>
 
int main() {
int a[20],size=0,rows,sum,i,j,depth,height,left,right;
clrscr();
 
printf("Input the number of rows(>1 & <=100) :");
scanf("%d",&rows);
 
for(i=1;i<=rows;i++) {
printf("Input %d number(s) between 0 & 99 for row %d :",i,i);
for(j=1;j<=i;j++) {
scanf("%d",&a[size++]);
}
}
 
i=0;
sum=a[0];
depth=0;
height=rows-1;
 
while(depth<height) {
 
left=a[i+depth+1];
right=a[i+depth+2];
 
if(left>right) {
sum=sum+left;
i=i+depth+1;
}
else {
sum=sum+right;
i=i+depth+2;
}//end of if
 
depth++;
}//end of while loop
 
printf("Highest sum : %d",sum);
getch();
 
return 0;
 
}

The logic is wrong, its not working even for my data.

If there is a big number at the top level you are taking that direction what will it happen if from that route on all are small numbers!

for the data given by me it should give 30 as answer but your code gives 28.

It is taking this route 7 8 1 7 5=28
instead of 7 3 8 7 5=30 the correct route.


the list of possible paths for my given problem for reference

7 3 8 2 4=24
7 3 8 2 5=25
7 3 8 7 5=30
7 3 8 7 2=27
7 3 1 7 5=23
7 3 1 7 2=20
7 3 1 4 2=17
7 3 1 4 6=21
7 8 1 7 5=28
7 8 1 7 2=25
7 8 1 4 2=22
7 8 1 4 6=26
7 8 0 4 2=21
7 8 0 4 6=25
7 8 0 4 6=25
7 8 0 4 5=24
Big = 30

Prakash, let me know if you need any clarification regarding my comment.


Thanks & Regards
Sriram

Try the code:

#include "stdio.h"

#define MAX_SUPPORTED_ROWS 100

int sum(int a[MAX_SUPPORTED_ROWS][MAX_SUPPORTED_ROWS], int row_count, int i, int j) {
  int highest_sum = 0;
  if(i == (row_count-1)) {
    highest_sum = a[i][j];
  } else {
    int left_sum = sum(a, row_count, i + 1, j);
    int right_sum = sum(a, row_count, i + 1, j + 1);
    if(left_sum > right_sum) {
      highest_sum = a[i][j] + left_sum;
    } else {
      highest_sum = a[i][j] + right_sum;
    }
  }
  return highest_sum;
}


int main() {
  int a[MAX_SUPPORTED_ROWS][MAX_SUPPORTED_ROWS] = {0};
  int row_count = 0;
  int i = 0, j = 0;

  scanf("%d", &row_count);
  if((row_count < 1) || (row_count > 100)) {
    printf("Invalid row count");
    return 0;
  }

  for(i = 0; i < row_count; i++) {
    for(j = 0; j <= i; j++) {
      scanf("%d", &a[i][j]);
      if((a[i][j] < 0) || (a[i][j] > 99)) {
        printf("Invalid values");
        return 0;
      }
    }
  }

  printf("Row count: %d\n", row_count);
  printf("Data:\n");
  for(i = 0; i < row_count; i++) {
    for(j = 0; j <= i; j++) {
      printf("%d ", a[i][j]);
    }
    printf("\n");
  }

  int highest_sum = sum(a, row_count, 0, 0);
  printf("Highest sum: %d\n", highest_sum);

  return 0;
}

Compile the file with above code and run as:
a.exe < input.txt > output.txt [on windows]
a.out < input.txt > output.txt [on linux]

Here,
a.exe or a.out are the executables generated after compilation
input.txt is the file containing input as specified in the problem statement
output.txt is the output file containing result

-Pradeep

Guys, do enclose your code in

 , [ / code ] tags (remove the spaces)

Beautiful program Pradeep.
You rock! my vote for you for Special CEan!

Prakash, is also on the way.


Thanks & Regards
Sriram

Thank you Sriram.

I would now like to take the problem to next level.

Modify the sample program given above (or write your one code) that not only print the highest sum but also print the exact number with their positions that sums to highest value, e.g., for the sample input data given in the problem statement, output should be:

Highest sum: 30
Data:
[1,1]: 7
[2,1]: 3
[3,1]: 8
[4,2]: 7
[5,2]: 5

-Pradeep

Yes, that will be bit tricky as yours is recursive.
Go ahead, meanwhile let me think for some other Challenge.

Thanks & Regards
Sriram

No taker for the second part of the problem 😔

Ok, here is my solution.

#include "stdio.h"

#define MAX_SUPPORTED_ROWS 100

int sum(int a[MAX_SUPPORTED_ROWS][MAX_SUPPORTED_ROWS], int pos[MAX_SUPPORTED_ROWS], int row_count, int i, int j) {
  int highest_sum = 0;
  int pos_left[MAX_SUPPORTED_ROWS] = { 0 };
  int pos_right[MAX_SUPPORTED_ROWS] = { 0 };
  int x = 0;

  pos[i] = j;
  if(i == (row_count-1)) {
    highest_sum = a[i][j];
  } else {
    int left_sum = sum(a, pos_left, row_count, i + 1, j);
    int right_sum = sum(a, pos_right, row_count, i + 1, j + 1);
    if(left_sum > right_sum) {
      highest_sum = a[i][j] + left_sum;
      for(x = (i+1); x < row_count; x++) {
        pos[x] = pos_left[x];
      }
    } else {
      highest_sum = a[i][j] + right_sum;
      for(x = (i+1); x < row_count; x++) {
        pos[x] = pos_right[x];
      }
    }
  }

  return highest_sum;
}


int main() {
  int a[MAX_SUPPORTED_ROWS][MAX_SUPPORTED_ROWS] = {0};
  int pos[MAX_SUPPORTED_ROWS] = {0};
  int row_count = 0;
  int i = 0, j = 0;

  scanf("%d", &row_count);
  if((row_count < 1) || (row_count > 100)) {
    printf("Invalid row count");
    return 0;
  }

  for(i = 0; i < row_count; i++) {
    for(j = 0; j <= i; j++) {
      scanf("%d", &a[i][j]);
      if((a[i][j] < 0) || (a[i][j] > 99)) {
        printf("Invalid values");
        return 0;
      }
    }
  }

  printf("Row count: %d\n", row_count);
  printf("Data:\n");
  for(i = 0; i < row_count; i++) {
    for(j = 0; j <= i; j++) {
      printf("%d ", a[i][j]);
    }
    printf("\n");
  }

  int highest_sum = sum(a, pos, row_count, 0, 0);
  printf("\nHighest sum: %d\n", highest_sum);
  printf("Data:\n");
  for(i = 0; i < row_count; i++) {
    printf("[%d,%d]: %d\n", i + 1, pos[i] + 1, a[i][pos[i]]);
  }

  return 0;
}

-Pradeep

but code given calculates the maximum count for a particular row but that may not leed to maximum count for the complete triangle

sreelu_a

but code given calculates the maximum count for a particular row but that may not leed to maximum count for the complete triangle

The code posted in the thread determines the path in the triangle that sums to maximum count in the triangle and prints the count (this is as per requirement stated in problem statement).

Please run the second code posted by me with sample data posted in the problem or your own seed data. Let me know if it does not work for any data (also post the seed data in that case).

-Pradeep