CodeChef submission 1595846 (C) plaintext list. Status: AC, problem MGCRNK, contest DEC12. By death (death), 2012-12-05 12:36:04.

#include<stdio.h> #include<math.h> float max(int n,int arr[n][n]) { int i,j,ct; int value[n][n]; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { if (i == 0 && j == 0) value[i][j] = arr[i][j]; else if (i == 0) value[i][j] = value[i][j-1] + arr[i][j]; else if (j == 0) value[i][j] = value[i-1][j] + arr[i][j]; else { if(value[i][j-1]>value[i-1][j]) value[i][j] = value[i][j-1] + arr[i][j]; else value[i][j] = value[i-1][j] + arr[i][j]; } } } return (value[n-1][n-1]); } int main() { int test,lp; for(lp=0;lp<test;lp++) { int n,i,j,ct; ct=1+(n-2)*2; int s[n][n]; for(i=0;i<n;i++) for(j=0;j<n;j++) float answer=max(n,s); if(answer>=0) else } return 0; }

## Comments

**Please login at the top to post a comment.**

## How is it possible that bound

rajusdhoble@ 11 Dec 2012 04:08 PM## It is not an error as the

bruno_adm@ 11 Dec 2012 04:26 PM