0
Your rating: None
CodeChef submission 630101 (JAVA) 

CodeChef submission 630101 (JAVA) plaintext list. Status: RE, problem SUMTRIAN, contest . By ank007 (ank007), 2011-08-21 13:02:42.
  1. import java.util.*;
  2. class mainn
  3. {
  4. 	static int high=0;
  5. 	static Scanner sc=new Scanner(System.in);
  6. 	public static void main(String arg[])
  7. 	{
  8. 		int n=sc.nextInt();
  9. 		for(int a=0;a<n;a++)
  10. 		{
  11. 			int lines =sc.nextInt();
  12. 			String st[]=new String[lines];
  13. 			for(int b=0;b<lines;b++)
  14. 			{
  15. 				st[b]=sc.next();
  16. 			}
  17. 			for(int i=0;i<lines;i++)
  18. 			{
  19. 				int lno=0,temp=0;
  20. 				for(int k=0;k<(lines-i);k++)
  21. 				{
  22. 					temp+=st[lno].charAt(0)-48;
  23. 					lno++;
  24. 				}
  25. 				for(int j=0;j<i;j++)
  26. 				{
  27. 					int temp1=0,pos=1,lno1=lno;
  28. 					for(int l=0;l<i;l++)
  29. 					{
  30. 						temp1+=st[lno1].charAt(pos)-48;
  31. 						if(l<j)
  32. 							pos++;
  33. 							lno1++;
  34. 					}
  35. 					if(temp+temp1>high)
  36. 						high=temp+temp1;
  37. 				}	
  38. 			}
  39. 		System.out.println(high);	
  40. 		}
  41. 	}
  42. }

Comments