Sums in a Triangle

All submissions for this problem are available.
Let's consider a triangle of numbers in which a number appears in the first line, two numbers appear in the second line, three in the third line, etc. Develop a program which will compute the largest of the sums of numbers that appear on the paths starting from the top towards the base, so that:
 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;
 the number of rows is strictly positive, but less than 100
 all numbers are positive integers between O and 99.
Input
In the first line integer n  the number of test cases (equal to about 1000).
Then n test cases follow. Each test case starts with the number of lines which is followed by their content.
Output
For each test case write the determined value in a separate line.
Example
Input: 2 3 1 2 1 1 2 3 4 1 1 2 4 1 2 2 3 1 1 Output: 5 9
Warning: large Input/Output data, be careful with certain languages
Author:  admin 
Tags  admin 
Date Added:  1122008 
Time Limit:  3 sec 
Source Limit:  5000 Bytes 
Languages:  ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.3.2, CPP 4.9.2, CPP14, CS2, D, ERL, FORT, FS, GO, HASK, ICK, ICON, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, NODEJS, PAS fpc, PAS gpc, PERL, PHP, PIKE, PRLG, PYPY, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM chicken, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 
first i used recursion, then it exceeded time limit. so, i use memoization.
i cannot understand how the path has to be recognised?
The question is not clear... the path has been described as starting from the top and then either directly below or below and one place to the right. Following this instruction, for the first test case the path should be "122" which gives 5(correct). But for the second case the path should be "1221" which gives 6(incorrect).
Is the instruction saying this or is it just finding the largest number on each level and adding them(excluding the first level).... because this seems to give the right answer for the sample test case provided.
u hav to find d largest sum not just add the largest number.. the path to follow in 2nd test case wud be 1143 which wud giv 9.. correct answer!!!
I have tested the problem on different sizes, but it still shows wrong answer.. i am using dev c . I am taking the input as in to get a value i use scanf and then u have to press the enter... is this not the way i should take input for this problem ...??
The way you are taking input is fine.
Almost everyone is taking 0.72 seconds to solve this problem in C/C . How is it that a Java solution notched up 0.49 seconds??? Admins can you please investigate? Also, I would love to know how Lucasz managed to notch up 0.20 seconds for this problem.
@Admin .. so what can be the problem with it ...?
In the forum it is written that content of any line n should not be greater than n except the last line i.e. n=100.
Is it true cause its no where mentioned
None of the numbers will be greater than 99. Only the last line will have 'n' numbers. So if 'n' is 100, the last line for that test case will have 100 numbers.
Sorry, 'n' is always less than 100. The maximum value of 'n' would be 99.
can anyone go through my solution and point out how to optimise my code further, because I have tried my best and I am still getting TLE.
@admin : Please help
First try finding the complexity of your solution and then see if it will run within time based on your calculations.
i am not using recursion and yet I still always exceed the time limit. Is this problem not possible to accomplish in a language like python in the time limit specified. I compute the solution bottom up inside a for loop. I looked on the list of successful solutions for this problem and there was only one python submissions that was on there and it took more than the specified 3 second time limit.
Currently the time limit for Python is 2 times that for C/C
Hint : you only need to find the largest sum, not necessarily the path.
No, you need to reread the problem statement.
I just compiled my prog in MVC (.h , .cpp) successfully.But it threw errors in gcc
You don't need a .h file, just the .cpp file that takes the input, processes it and prints the output is to be submitted.
Hey, can i get some help? its my first code here :) and i think my algo is correct but i'm getting the result as a wrong answer (as you can see). So is there any specific case that i'm missing??
Hey, can anyone suggest me
Hey, can anyone suggest me why my code is giving me the compile error?? i have developed the code using turbo c++....and it is working fine there???
Pls help me!!
Read the FAQ. (We can't see
Read the FAQ.
(We can't see your code anyway, unless you post it in the forum).
hi admin, what is the method
hi admin,
what is the method of inputting i.e can i use 'cin' for numbers in the line or some other way to do it.
You have to read the numbers
You have to read the numbers from stdin and output your answers to stdout. You can use cin.
@admin can i get more
@admin
can i get more testcases for this problem , my code runs correctly with provided testcases but chef says it gives incorrect result.
help.
We use this problem for
We use this problem for recruitment purposes and as such we can't give out specific test cases. :(
i'm nt gettin link f solution
i'm nt gettin link f solution fr dis prblm??
The solutions are not public
The solutions are not public for this problem.
can some one please make me
can some one please make me understand this question!!!!!!!!!!!
if the max no of lines in
if the max no of lines in each case is 99 at worst case, then it would contain 4950 integers in the triangle.
in this case it wud need 19800 bytes to storage.
but acc to the problem statement the resources is restricted to 5000bytes.
That limit is on the length
ohh, thx
ohh, thx
Does that mean there is no
Does that mean there is no restriction on the space complexity of the code.?
No, read the FAQ for more
This code working fine on my
I am using java.util.Scanner
import
Read the FAQ and
plz help ..i have tried my
plz help ..i have tried my best to minimize the iterations but still the tym limit is exceeding...here is the code..
#include<iostream>
using namespace std;
main()
{
int t;
cin>>t;
int k[t],n[t],j;
double o[t];
for(int i=0;i<t;i++)
{cin>>n[i]>>k[i];
o[i]=n[i]1;
j=n[i]2;
while(j>n[i]k[i])
{
o[i]*=j;
j;
}
j=k[i]1;
while(j>0)
{
o[i]/=j;
j;
}
cout<<o[i]<<"n";
}
}
plz help...
o sorru admin this code was
o sorru admin this code was for the problem marbels..plz consider it..
o sorry admin this code was
o sorry admin this code was for the problem marbels..plz consider it..
Im getting a runtime error.
Im getting a runtime error. Im not sure what it is but it could be that im using too much memory. If any one knows how to use less memory or if the error could be somthing else plz help. Im using Java
No, you shouldn't get an NZEC
No, you shouldn't get an NZEC error for using too much memory. Your code will likely be throwing some sort of exception.
You might want to check if
You might want to check if your I/O is in accordance with the input and output specifications.
ok so i think i got it, there
ok so i think i got it, there are spaces between each number and each number can be up to 2 digits long.
does the input method have to
does the input method have to be different for space separated numbers . i am using separate cin for each number in a row and for each row . is tht wrong
If you are taking one number
If you are taking one number at a time, then you should be fine.
@Admin can you please let me
@Admin can you please let me know why I am encountering runtime error (NZEC) from my latest submitted solution.
@apt2D NZEC appear to me for
@apt2D
NZEC appear to me for input problems... are you reading the standard input ?
@German Gonzalez I am reading
@German Gonzalez
I am reading standard input, when I use Scanner to read input it throws time limit exceeded so I changed to read by BufferedReader it bounces with runtime error(NZEC)
@apt2D here you have
@apt2D
here you have official information: http://blog.codechef.com/2009/02/24/54/
where it has a link to the forums with different languages solution, and yes, for Java use BufferedReader
@German Gonzalez I am using
@German Gonzalez
I am using Buffered reader, it works fine for large input too but don't know why encountering runtime error
@Admin
Hope you check on this! Eager to know what's wrong with the code,why I am getting runtime error. Previously you never got back :(
hi I have the solution but it
hi
I have the solution but it is showing time limit exceeded ...
.
I am using a recursive algo .
anyone can please suggest what sort of optimisation can be done
hi I have the solution but it
hi
I have the solution but it is showing time limit exceeded ...
.
I am using a recursive algo .
anyone can please suggest what sort of optimisation can be done
don't use recursion at all.
don't use recursion at all. You mst figure out another lineal solution.
If u use recursion , make
If u use recursion , make sure u memoize. It will run within time.
the unused array trick sped
the unused array trick sped my C# program up from 2.69 to .07 seconds, an increase of 38 times... unbelievable.
in case you didn't catch my posts on this before, the trick consists of adding a huge array to the stack (or heap, I don't know how csharp does things internally) like so:
int[] data = new int[1000000];
whether you use it or not (if you don't, the compiler might give you a warning; ignore it) it speeds up programs like crazy. if anyone can explain this, please do!
After using memoization , my
After using memoization , my code's execution time improved but it is still long.
can anyone suggest me how to optimize it furthur.
i tried out a simple
i tried out a simple nonrecursive solution and it was accepted !!
@ Admin My working all right
@ Admin
My working all right on my PC but when I submit it here it shows runtime error. Please check and let me know the problem.
regards
Harpreet
I mean my solution is
I mean my solution is working........
y dere is no tutorial for
y dere is no tutorial for this ques.......... how do we solve this....
sir i cnt understand d
sir i cnt understand d problem tht wht i have to do.
pls explain me in detail:
my_id:rajesh91bhatia@gmail.com
Can somebody give me a few
Can somebody give me a few more test cases ? My code works fine for the cases given and Code chef say "Wrong Answer' for my code.
You should be able to make up
You should be able to make up cases just as well as anyone else can.
My code's working for the
My code's working for the test cases and i believe it works for other cases also. Still it is showing runtime error. The code in Python is as follows:
#Sums in a Triangle
l=[]
sum=[]
n=input()
for i in xrange(1,n+1):
k=input()
for j in xrange(0,k):
l.append([])
l[j]=raw_input().split(' ')
l=[map(int,x) for x in l]
for m in xrange(0,j):
if j>=1:
if m==0:
l[j][m]=int(l[j][m])+int(l[j1][0])
elif m==j1:
l[j][m]=int(l[j][m])+int(l[j1][m1])
else:
l[j][m]=int(l[j][m])+int(max(int(l[j1][m1]),int(l[j1][m])))
sum.append(max(l[k1]))
for i in sum:
print i
Are negative integers also
Are negative integers also allowed?
@Haritosh: no, negative
@Haritosh: no, negative numbers will not be given, according to the problem statement. Some suggestions: although you _can_ use "sum" as a variable name, it is inadvisable because it is also has meaning as a part of the language. I doubt that is what's causing the error, but you might as well fix that. And you might get rid of unnecessary int() calls, for clarity's sake. And please read the FAQ for information on how to post your code the correct way (as a link, not here in the comments section of the problem pages).
plz clarify what does
plz clarify
what does Memory2000 means is it byte or megabyte
Hi admin, I have submitted a
Hi admin,
I have submitted a code and it seems that the code is exceeding the time limit. Can you please help me point out which part of my code is consuming more time?
You obviously haven't tried
You obviously haven't tried testing your program!
Not only does it appear to be giving the wrong answer for small inputs, including the sample input, but it is going to take forever on any large input. Try testing your program with 1 input with 99 rows and you will see why. By my calculations, your code would take over 100000000000000 years to finish running :)
(Also, read the FAQ if you haven't already, as it explains how to test your program.)
What the output of that test
What the output of that test case
2
5
1
2 1
1 2 3
1 2 3 4
1 1 1 1 1
4
1
1 2
4 1 3
2 3 1 1
Plz anybody help me.
Plz anybody help me.
Hello All , I'm new to this
Hello All ,
I'm new to this forum , i found this intersting i wanna ask u will this problem require any datasturucture or it is crude implementation
pls leave a reply
@ Najmuzzaman According to
@ Najmuzzaman According to me, the answers of the test cases should be 10 and 9 respectively.
is it necessary to take input
is it necessary to take input in the format as specified in the problem. i mean, cant we input one number at a time???
I am taking one no. at a time & the prog. is working fine for all the test cases i have considered till now. But still i get a runtime error (NZEC) when i submit it.
#include<stdio.h>int main(){
#include<stdio.h>
int main(){
int i,j,k,n,t;
double val[1000],kal[1000],a;
kal[0] = 0;
scanf("%d",&n);
while(n){
scanf("%d",&t);
a = 0;
for(i=0; i<t; i++){
val[i] = 0;
for(j=0; j<=i; j++){
if(j>0) kal[j] = val[j1]  k;
scanf("%d",&k);
val[j] += k; //sum of direct below in a row.
kal[j] += k; //sum of direct below & one right most.
}
a += k; //sum of the otivuj.
}
kal[0] = 0;
for(i=0; i<t; i++){
if(a<val[i]) a = val[i];
else if(a<kal[i]) a = kal[i];
}
printf("%.0fn",a);
}
return 0;
}
someone plz help. i didn't find any wrong, for test case. But i found wrong answer.
@ Admin How did Saurabh
@ Admin How did Saurabh manage a solution which takes 0.00 time and 0.00 memory ????
im getting this error! what
im getting this error! what do i do????
/sources/tested.cpp:1:21: error: iostream.h: No such file or directory
That message is pretty clear.
That message is pretty clear. There is no such thing as iostream.h.
@ asloob...use
@ asloob...use #include<iostream> instead.
hi can anyone help me with
hi can anyone help me with
Hi all I am getting run time
Hi all
I am getting run time error..
so I used max possible input in my local to test...
i.e 99 rows each row contains number 99 only..
basically a triangle with all the values as 99.
but, I am receiving below error 
Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
plz suggest sumthing..
this problem has frustated me
this problem has frustated me to the limit of insanity .did everything correct tried different different algorithms but nuthing worked
@admin i am getting a runtime
@admin
i am getting a runtime error(other).. now what is that for?
i mean i am only using a
i mean i am only using a small array 0f size 200 of integer type..
You declare an array of size
You declare an array of size 200 and the first thing you do is access elements up to index 250..
Anyone had any success with
Anyone had any success with this problem in PHP? I can't optimize my code any further than this, and it still gives me a Timelimit Exceeded.
is it an application of
is it an application of longest path algorithm
sir...............i tried the
sir...............i tried the sample inputs and also inputs of may own.......and i got the desired output.........but on
codechek.....i am getting wrong answer ....its really frustrating........................plz tell me the bug in my program...........................plz......plz......................
sorry spelling
sorry spelling mistake..............*codechef
plz...check the code
plz...check the code >http://www.codechef.com/viewsolution/244226
how do u do this problem? i
how do u do this problem?
i am not able to get algo?
@Admin: I first solved the
@Admin:
I first solved the problem in 0.73 secs and then improved it to .70, but it still shows 0.73 s against my name :(
@Admin I have 8 successful
@Admin
I have 8 successful perl submission for this problem but all TLE :(
As I do not see any submission in perl, I would like to know if this problem can be solved in the given time in Perl or is does it require any extra time for perl.
@Admin 15 Successful
@Admin
15 Successful Submissions .. still Time Limit Exeeded.
I strongly suggest that you should perhaps consider increasing the time for Perl submissions for this problem.
A small python script to
A small python script to generate the input for this problem (Note: Modified the script provided by Pushparajan V in Enormous Input Test problem)
#! /usr/local/bin/python
import os
import random
f = open("sample.txt","w")
testcase=random.randint(999,1001)
f.write(str(testcase) + "n")
while (testcase):
rownum=random.randint(1,99)
f.write(str(rownum) + "n")
for i in range(1,rownum+1):
for j in range(0,i):
f.write(str(random.randint(0,99)) + " ")
f.write("n")
testcase=testcase1
f.close()
My code works fine with the
My code works fine with the test cases given here on my compiler. But i am getting "wrong answer" here. Can anyone point to me the flaws??
#include<stdio.h>
int main(){
int final[1000],arr[2][100];
char str[300];
int i,j,k,a,b,c,max_so_far=1,coll,index=0;
scanf("%d",&a);
for(i=1;i<=a;i++)
{
scanf("%d",&b);
for(j=1;j<=b;j++)
{
gets(str);
if(str[0]=='')
{
j;
continue;
}
coll=1;
c=0;
k=0;
while(1)
{
if(str[k]==' 'str[k]=='')
{
if(j==1)
arr[index][1]=c;
else if(coll==1)
arr[index][1]=arr[(index+1)%2][1]+c;
else if((arr[(index+1)%2][coll1])>arr[(index+1)%2][coll])
arr[index][coll]=arr[(index+1)%2][coll1]+c;
else
arr[index][coll]=arr[(index+1)%2][coll]+c;
c=0;
if(max_so_far<arr[index][coll])
max_so_far=arr[index][coll];
if(str[k]=='')
break;
coll++;
}
else
c=10*c+(str[k]'0');
k++;
}
index=(index+1)%2;
}
final[i]=max_so_far;
}
for(i=1;i<=a;i++)
printf("%dn",final[i]);
return 0;
}
i got my flaws in the
i got my flaws in the previous code.sorry for the inconvenience.
I rectified the flaws i
I rectified the flaws i caught but still am getting "wrong answer". Please help me out.
#include<stdio.h>
int main(){
int final[1000],arr[2][100];
char str[300];
int i,j,k,a,b,c,max_so_far=1,coll,index=0;
scanf("%d",&a);
for(i=1;i<=a;i++)
{
scanf("%d",&b);
for(k=0;k<2;k++)
for(c=0;c<100;c++)
arr[k][c]=0;
for(j=1;j<=b;j++)
{
gets(str);
if(str[0]=='')
{
j;
continue;
}
coll=1;
c=0;
k=0;
while(1)
{
if(str[k]==' 'str[k]=='')
{
if(j==1)
arr[index][1]=c;
else if(coll==1)
arr[index][1]=arr[(index+1)%2][1]+c;
else if((arr[(index+1)%2][coll1])>arr[(index+1)%2][coll])
arr[index][coll]=arr[(index+1)%2][coll1]+c;
else
arr[index][coll]=arr[(index+1)%2][coll]+c;
c=0;
if(max_so_far<arr[index][coll])
max_so_far=arr[index][coll];
if(str[k]=='')
break;
coll++;
}
else
c=10*c+(str[k]'0');
k++;
}
index=(index+1)%2;
}
final[i]=max_so_far;
max_so_far=1;
}
for(i=1;i<=a;i++)
printf("%dn",final[i]);
return 0;
}
@ admin please give me a test
@ admin
please give me a test case for which the above posted code is not working..
Please, somebody, tell me,
Please, somebody, tell me, it's deikstra algorithm is here ?
Somebody please tell me why
Somebody please tell me why am I getting a runtime error:
http://www.codechef.com/viewsolution/269260
Can somebody please tell what
Can somebody please tell what is wrong with my code!!!,that it produces runtime error.It easily works in my pc for the worst case. :(
http://www.codechef.com/viewsolution/269260
abcd : I am not sure if this
abcd : I am not sure if this is the (only) reason causing it , but sometimes Integer.parseInt() returns a NumberFormatException if there are any trailing spaces after the integer and at least the sample test case does. I'd recommend trimming the read line using trim() ... try passing in.readLine().trim() to Integer.parseInt and see if that works.
@Antapreet Singh Thanks
@Antapreet Singh
Thanks again,the runtime error is now removed :) ,But now I am facing a wrong answer :(
Please check if my algo is wrong:
(coz u gave a good example in tidying posters)
I start from the bottommost row and move upwards or upleftwards depending on the element at these positions which is greater.
max_sum(x,y)=max_sum(x,y)+max{element(x1,y),element(x1,y1)}
and then check for the max sum (after checknig sum for each element in the bottom most row.Bottommostrow only because every path has to terminate there.)
A simple example of why a
A simple example of why a greedy approach has no chance of being correct:
1
6
1
1 1
1 99 1
2 1 1 2
1 2 1 2 1
1 1 1 1 1 1
Try the following test case :
Try the following test case : (Expected output is 7 )
1
4
1
1 3
2 1 1
1 2 1 1
Dear admin, please rerun the
Dear admin, please rerun the #1 solution. After successfully reaching #2 place i was able to retest the #1 solution on my own PC and it was far away from reaching 0.00 sec with 0MB ...
sum1 give me the code....nt
sum1 give me the code....nt able to solve this....without iteration
plz sum1 post his/her code
plz sum1 post his/her code here..
tested my code on 1000 random
tested my code on 1000 random cases on my machine
the code is working fine on my system
byt throwing runtime error(NZEC ) here.......
any suggestions??
but*
but*
Hi admin I am using java as
Hi admin
I am using java as programming language and trying to solve the problem using recursion but i m getting time limit exceeded.
Can you please look into the solution and inform me where i am wrong
Please mail me at shashikant.awasthi@gmail.com
@Admin: I'm a bit confused
@Admin: I'm a bit confused about the second input... it says: "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;" so for the second input the path should be 1 2 4 3 and thus the answer would be 10, but it shows the answer is 9.how the path is 1 1 4 3 ? please explain.
thanks
The number directly below the
The number directly below the 2 in the second row is 1, and the number below and one place to the right is 2. So you can't possibly move from 2 to 4 like in your solution.
contents of trinagle for
contents of trinagle for example
1
2 3
3 5 7
9 3 1 2
how it is supposed to enter 1 than enter 2 than enter 3 than enter like that ?
I am confused with the first
I am confused with the first condition
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;
for example
if the input is
1
5
1
1 2
1 2 3
1 2 3 4
1 2 3 4 5
so what should be the total?
Is it 1 + 1 + 1 + 1 + 1 = 5
or
1 + 2 + 3 + 4 + 5 = 15
There are lots of valid
There are lots of valid paths, including both the ones you mentioned, as well as something like 1+2+2+2+3, and so on. The path with maximum sum is 1+2+3+4+5=15.
a simple bottom up DP
a simple bottom up DP problem...
let d[101][101] be the input
let
d[101][101] be the input data
a simple bottom up dp should be like this :
d[i][j] depends on d[i1][j1] and d[i1][j1]
so for(i=0;i<=n;i++)
d[0][i]=d[i][0]=0
Okay
now
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
d[i][j]=max(d[i1][j1],d[i1][j])
here last row d[n][1....n] contains the result
so find the maximux for the last of row.
really easy one! Just a
really easy one!
Just a simple dynamic algorithm would do well!
This problem is
This problem is interesting.
Don't use recursive, you will got time limit exceeded. Use looping method. :)
can someone help me in
can someone help me in solving this? My solution is coded like this:
The number of rows can also
The number of rows can also be equal to 100 contrary to what the description says. My program crashed because of this first.
You can use my testcases to test your program locally if you like: http://ul.to/u8mwex
No, the number of rows cannot
No, the number of rows cannot be equal to 100. Your code was crashing because an array of size 98 only stores enough room for 98 rows (0, 1, .., 97).
I am getting ":( internal
I am getting ":( internal error occured in the system". What does this error imply?
I got time limit exceeded
I am getting the WA with this
I am getting the WA with this code.Anyone plz help.
#include<iostream>
#include<stdlib.h>
using namespace std;
long long array[101][101]={0},ans,ans1,a,b;
long long recurse(long long ans1,long long i,long long j,long long n);
int main()
{
long long i,j,n,sum,tests;
cin >> tests;
while (tests)
{
cin >> n;
for ( i = 0 ; i < n; i++)
{
for ( j = 0 ; j <= i ; j++ )
{
cin >> array[i][j];
}
}
ans=array[0][0];
ans1=0;
long long sum = recurse(ans1,0,0,n);
cout << sum << endl;
}
}
long long recurse(long long ans1,long long i,long long j,long long n)
{
if ( i == n1 )
return ans;
else{
ans += max(recurse( array[i+1][j] , i+1,j,n ),recurse( array[i+1][j+1] , i+1,j+1,n));
}
}
http://www.codechef.com/views
http://www.codechef.com/viewsolution/366040
my program is exceeding time limits, can anyone please suggest something.
There could be up to 2^100
There could be up to 2^100 possible paths, so trying them all will never work in time. The aim of this problem is finding a way to guarantee you've found the best sum without trying every path individually.
#include<stdio.h>int main(){
#include<stdio.h>
int main()
{
int n, i, j,k,sum1,sum2, lines, *array[100];
scanf("%d", &n);
for(i = 1; i<=n; i++){
scanf("%d", &lines);
for(j = 0; j < lines; j++){
array[j] = (int*)malloc((j+1)*sizeof(int));
for(k = 0; k < j+1; k++){
scanf("%d", &array[j][k]);
}
}
for(j = lines2; j >= 0; j){
for(k = 0; k <= j+1; k++){
if((sum1 = (array[j][k]+ array[j+1][k])) > (sum2=(array[j][k]+array[j+1][k+1])))
array[j][k] = sum1;
else
array[j][k] = sum2;
}
}
printf("%d", array[0][0]);
}
return 0;
}
Can any one please help why is this showing a wrong answer and that too for which test case
Your program gives the wrong
Your program gives the wrong output for the sample input. Read the FAQ if you aren't sure how to test your code.
Hi there Admin, are there any
Hi there Admin, are there any plans to let us coders know which testcase produced a wrong answer kind of like in TC?
SB
I don't have any clue what to
I don't have any clue what to do in this one... I've spent hours thinking about what the correct method is, and have got nowhere... help me!
plz help with my code, i cant
plz help with my code, i cant find any error, is it the input output method? plz chk..
#include<stdio.h>
#define max 105
int main()
{
int a[max][max]={1};
int f[max][max]={1};
int i,j,t,n,ans=1;
//int m, l[max1][max1]={1};
scanf("%d",&t);
while(t)
{
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
scanf("%d",&a[i][j]);
/*
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
printf("%d",a[i][j]);
*/
f[1][1]=a[1][1];
for(i=2;i<=n;i++)
for(j=1;j<=i;j++)
{
if(f[i1][j]>f[i1][j1])
{
f[i][j]=f[i1][j]+a[i][j];
//l[i1][j]=j;
}
else
{
f[i][j]=f[i1][j1]+a[i][j];
// l[i1][j]=j1;
}
}
for(j=1;j<=n;j++)
{
if(f[n][j]>ans)
ans=f[n][j];
//m=j;
}
/* for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
printf("%d ",f[i][j]);
printf("n");
}
for(int i=0;i<n;i++)
{
printf("%d ",l[i][j]);
}
printf("%d",m);
*/
printf("%d",ans);
}
return 0;
}
my program is not taking too
my program is not taking too much of memory n the output am getting on my system is also correct but am getting runtime error dont know y?????..can sum1 plz help me wid my code http://www.codechef.com/viewsolution/392161
can anybody help me to get
can anybody help me to get rid of runtime error in this code plzzzz help me
#include<stdio.h>
#include<stdlib.h>
//int line;
int max(int *a,int i,int k)
{
int j,l;
if(a[0]==1)
return a[1];
else
if(k<a[0])
{
j=(j=max(a,i+k,k+1))>(l=max(a,i+k+1,k+1)) ?j:l;
return j+a[i];
}
else
return 0;
}
int main ()
{
int a[4950],*b,i,t,j=0;
scanf("%d",&t);
b=(int *)malloc(sizeof(int)*t);
while(t>0)
{
t;
scanf("%d",&a[0]);
a[0]=a[0]*(a[0]+1)/2;
for(i=1;i<=a[0];i++)
scanf("%d",&a[i]);
b[j]=max(a,1,1);
//printf("n sum=%d",max(a,1,1)) ;
j++;
}
for(i=0;i<j;i++)
printf("%dn",b[i]);
return 0;
}
@admin i wrote the code using
@admin i wrote the code using recursion it works perfect on my pc
here it says time limit exceeds
i dont care if it exceeds :))
and plz suggest ways to fix time problem( i use 'C')
p.s it was a goooood problem
You've tested it on an input
You've tested it on an input with 99 rows, right?
class triangle1{ public
class triangle1
{
public static void main(String args[])throws java.lang.Exception
{
byte a,i,j,k,l;
String s;
int tr[][]=new int[100][100];
int max;
java.io.BufferedReader br =new java.io.BufferedReader(new java.io.InputStreamReader(System.in));
s=br.readLine();
a=Byte.parseByte(s);
for(i=1;i<=a;i++)
{
s=br.readLine();
j=Byte.parseByte(s);
s=br.readLine();
tr[1][1]=Integer.parseInt(s);
for(k=2;k<=j;k++)
{
String I[]=br.readLine().split(" ");
for(l=1;l<=k;l++)
{
tr[k][l]=Integer.parseInt(I[l1]);
}
}
for(k=j;k>1;k)
{
for(l=1;l<j;l++)
{
if(tr[k][l]>=tr[k][l+1]) max=tr[k][l];
else max=tr[k][l+1];
tr[k1][l]=max+tr[k1][l];
}
}
System.out.println(tr[1][1]);
}
}
}
can u plz tell me admin why am i having runtime error when its mery is only 177.3
Java guys, be aware!! The
Java guys, be aware!!
The test input has a trailing(or leading) space in lines.
String.trim() your line before you split!! Else, you will get a runtime error.
Used a memoized java
Used a memoized java code......Input using Sanner...but still saying TLE...any suggestions admins?/???
A lot of TLE for my solutions
A lot of TLE for my solutions in Perl. It is totally equivalent in terms of complexity to others C codes that have passed. Please, consider a reasonable TL for Perl.
My solution worked with the
My solution worked with the examples but here it says 'wrong answer'. I've used recursion with memoization.
any correct submission using
@admin while using recursion
Ridiculous. I have the most
recursive algo with
Is it unable to do anything
#include int main() {
@ADMIN please check my
@Admin With reference to my
@trojan_horse:
Can anyone help in reducing
@gagangupt16: You will need
@gagan: Try DP. That must do
@admin this working fine but
getting a runtime error ?
plzzzz sm1 help me out. this
#include int rec(int
plzzzz sm1 help me out. this
@Admin: please look into this
@Admin I am getting runtime
#include int main() { int
can any body tell me why i`m
Hi. Just got here. So we
#include void main() { int
i dint get the
so in case of a 2 digit
how is the output
@admin im getting a time
import java.io.*; import
0;i) for(j=0;j
Guys in java don't use byte.
Can someone tell me why does
admin please help me..i'm
admin please help with my
@admin sir, is the solution
according to me the output of
easy one :)
Broke my head over it, and
@AdminShouldn't the output
@sumit_makkar and
@admin: we are getting the
@admin i dont know why am i
admin do we have to go
need help run time error , m
#include #include int
In the above code I am
WHAT IS THE PROBLEM IN MY
what is problem in this
What the duck? First there's
Hello, I have to admit that
i am getting wrong answer but
I am not sure how solutions
Hello Admin, Could you please
@admin : My program ran
hi!! can somebody tell me
Continuously getting runtime
4 years and nobody has gotten
getting wrong answer but i am
Why don't you people(Problem
can anybody give good test
Hello I need some help, I
My code is running in my
Can anyone explain to me how
@admin Why the path
@nityaneetu, you cant go left
not able to recognize the
MEMOIZATION just rocks!! DP!!
Why am i getting compile
for which test case this
@admin: could you please
@admin: The description for
what if the numbers exceed
Kindly take alook at my
please provide some test
For Java i recommend using a
admin can u plz tell where my
IS THE FIRST TEST CASE OF THE
how this is happening..can u
Is this problem related to
I cannot understand the
I have tried many inputs on
hey can anyone help me with
I canot understand the
i understand the question and
http://www.codechef.com/views
http://www.codechef.com/views
Why I am getting runtime
@admin suppose i give total
Is the allowed time limit
Kindly Help, this is giving
Kindly help, when i add below
Hi , Please help here I have
plz help me i am not
Awsome problem. Learn't a
http://www.codechef.com/views
@admin, At least, you must
hey admin my program works
in a single row, how are the
http://code.hackerearth.com/2
Has anything changed with the
on submission, it says wrong
@admin Shouldn't the
@admin I guess there should
No need of dynamic
I don't understand why people
somebody please point out the
AC in one go :P
http://www.codechef.com/views
I have executed a recursion +
This is my code. I have used
can any one explain me the
I do not understand the
sir plzz help.. if we have
when I use scanf, my code
the judge is not adjusted for