OJ Board

make sure to read input line by line. it's imperative.

This problem is horribly written and doesn't include bounds on the input. Read and process everything as strings. The problem might talk about everything being integers, such as In next lines there are N positive integers. So you read and process items as int32s, then int64s... But the problem never...

hopefully anyone that searches the forums for python code submission format can find this:

I've submitted an AC solution with this format

What's the format for submitting python source?

def main():
#entry point ?

or some kind of class Main?

input: 1a 0 output 29 The java solution would throw a runtime error.. also: input -2 -1 0 gives *3 when the java solution should give -3 input: 000 0 gives nothing, when the java AC solution would report 0. I know the problem statement says: The input will consist of at most 100 lines of text, each ...

The udebug code for this problem has to be wrong.
The java AC solution reads big integers until the number equals 0 and keeps the running sum.

Try input: 1000 4000 1100 3000 2000 1900 2002 1900 2001 1899 You code is correct if you remove the debug info it prints: 4 1 2 3 5 However if you change to left.weight < right.weight it incorrectly prints: 4 1 2 4 5 shouldn't 4 1 2 3 4 be an acceptable answer too? I've been getting WA from the judg...

Yeah... I was trying that... it's commented out in the main function because I was still getting WA Then I saw: shariftech, The outputs of two consecutive cases will be separated by a blank line. Always print a newline char at the end of the last line. and changed it and got WA *edit* actually, mayb...

I'm gonna throw my code up here because I'm not exactly sure what I'm doing wrong for this problem. I'm new to trying to solve graph problems (that weren't implicit graphs modeled as ascii maps for like floodfill problems), so I'm trying to model this problem input as an adjacency matrix... and I th...

omfg. Java BigDecimal method stripTrailingZeros only works some of the time (actually it seems to only work for zeros after the decimal point). Hence the stupidly looking use of compareTo.

Thank you brianfry

idk what could be wrong with this supposedly easy problem.... something really stupid is catching me.
So here's my code while I go do something else. Thank you

is using java BigInteger TLE? I can't seem to optimize a java solution enough to pass the time limit.

that's so smart... why was I trying to rely on human ingenuity

would you do this during an actual contest? to make it feasible for that enviroment

I'm wondering how you've developed the strategy to determine critical test cases so that I may share the knowledge with others.

Thanks in advance!

Thank you. someone posting : 701997118012300111111117 3333332351100101110150141120123101411792310178 helped me change if (i+2 <= line.length()) to if (i+2 < line.length()) but it wasnt until I added if (cin.peek() == cin.eof()) return false; in my getInput() function that I finally got AC