0
Your rating: None
CodeChef submission 675828 (C) 

CodeChef submission 675828 (C) plaintext list. Status: RE, problem SUMTRIAN, contest . By potter_nsit (potter_nsit), 2011-09-28 08:24:46.
  1. #include<stdio.h>
  2. //#include<malloc.h>
  3. struct myvar{
  4.        int a;
  5.        int b;
  6.        };
  7. typedef struct myvar myvar;
  8.  
  9. int sumtobase(myvar **intpyr,int row,int col,int size)
  10. {
  11.     if(intpyr[row][col].b != 0 )
  12.            return intpyr[row][col].b;
  13.     else
  14.     {
  15.         int way1,way2;
  16.         way1 = intpyr[row][col].a + sumtobase(intpyr,row+1,col+1,size);
  17.         way2 = intpyr[row][col].a + sumtobase(intpyr,row+1,col,size);
  18.         if(way1 > way2)
  19.         {
  20.             intpyr[row][col].b = way1;
  21.             return way1;
  22.         }
  23.         else
  24.         {
  25.             intpyr[row][col].b = way2;
  26.             return way2;
  27.         }
  28.     }
  29. }
  30.  
  31. int main()
  32. {
  33.     //declaringd the variables
  34.     int itr;
  35.     int size;
  36.     myvar **pyramid;
  37.     int *ans,i;
  38.     //getting the number of pyramids
  39.     scanf("%d",&itr);
  40.     ans = (int*)malloc(itr*sizeof(int));
  41.     for(i = 0; i < itr; i++)
  42.     {
  43.         int j,k=0;
  44.         char temp;
  45.         scanf("%d",&size);
  46.         pyramid = (myvar**)malloc(size*sizeof(myvar*));
  47.         for(j = 0; j < size; j++)
  48.         {
  49.     	    pyramid[j] = (myvar*)malloc((j+1)*sizeof(myvar));
  50.     	    for(k = 0;k<=j;k++)
  51.     	          {
  52.                   scanf("%d",&pyramid[j][k].a);// = 0;
  53.                   pyramid[j][k].b = 0;
  54.                   }
  55.         }
  56.         for(k = 0;k<size;k++)
  57.               pyramid[size-1][k].b = pyramid[size-1][k].a;
  58.         
  59.         ans[i] = sumtobase(pyramid,0,0,size-1);
  60.     }
  61.     for(i = 0; i < itr; i++)
  62.         printf("%d\n",ans[i]);
  63.     //getch();
  64.     return 0;
  65. }
  66.

Comments