Let's consider a triangle of numbers in which one number appears in the first line, two numbers appear in the second line, three in the third line, etc. Develop a logic which will compute the largest of the sums of numbers that appear on the paths starting from the top towards the base, so that:1. On each path the next number is located on the row below, more precisely either directly below or below and one place to the right;2. The number of rows is strictly positive, but less than 1003. All numbers are positive integers between 0 and 99.

 #include <stdio.h>
int main()
{
    int i,n,j,t;
    scanf("%d",&t);
    while(t--)
    {
    scanf("%d",&n);
    int ar[n][n];
    for(i=0;i<n;i++){ 
    for(j=0;j<=i;j++){
    scanf("%d",&ar[i][j]);
    scanf("\n");}
    }
    for(i=n-1;i>=1;i--)
    {
    for(j=0;j<i;j++)
    {if(ar[i][j]>ar[i][j+1])
    ar[i-1][j]+=ar[i][j];
    else ar[i-1][j]+=ar[i][j+1];
    }
    }
    printf("%d\n",ar[0][0]);
    }
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Elavenil has a chessboard with N rows and M columns. In one step, he can choose two cells of the chessboard which share a common edge (that has not been cut yet) and cut this edge. Formally, the chessboard is split into two or more pieces if it is possible to partition its cells into two non-empty subsets S1 and S2 (S1∩S2=∅, |S1|+|S2|=NM) such that there is no pair of cells c1,c2 (c1∈S1,c2∈S2) which share a common edge that has not been cut.Elavenil does not want the board to split into two or more pieces. Compute the maximum number of steps he can perform while satisfying this condition.

 #include <stdio.h> int main() { int n,m; scanf("%d %d",&n,&m); printf("%d",(m-1)*(n-1)); return 0; }
Read more

Akash the die heart fan of AR Rahman went to the live concert happened in Bangalore with his family members.The event management firm responsible for the event arranged the seats for the audience in descending order of maximum number of tickets booked for single family.

 #include <stdio.h> int main() {int nooffamilymembers; scanf("%d",&nooffamilymembers); int r=nooffamilymembers; for(int i=1;i<=nooffamilymembers;i++){     for(int j=1;j<=r;j++){         printf("%d ",r);     }r--;     printf("\n");} return 0; }
Read more

Mahesh has given a two-dimensional 3*3 array starting from A [0][0]. You should add the alternate elements of the array and print its sum. It should print two different numbers the first being sum of A 0 0, A 0 2, A 1 1, A 2 0, A 2 2 and A 0 1, A 1 0, A 1 2, A 2 1.

 #include <stdio.h> int main() {   int A[3][3],i,j;     for(i=0;i<3;i++)     {for(j=0;j<3;j++)     {scanf("%d ",&A[i][j]);}}     int m=0,n=0;     for(i=0;i<3;i++){     for(j=0;j<3;j++){     if((i+j)%2==0)     m=m+A[i][j];     else     n=n+A[i][j];}}     printf("%d\n%d",m,n); return 0; }
Read more