Search found 1 match

by shafin5
Sun Nov 02, 2008 1:13 pm
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 52171

WA in 108

/*What is the problem in this solution of problem 108......plz help...*/


#include<stdio.h>
int i,j,p,q,n,ar[101][101],ar1[101][101];
int sum,max=-999999999;

int main ()
{
int s;
while(scanf("%d",&n) != EOF){

for(i=0;i<n;i++)
{
s=0;
for(j=0;j<n;j++)
{
scanf("%d",&ar [j]);
}
}
sum=0 ...

Go to advanced search