OJ Board

input: 9

output notice that -1<x<1

I have considered that one polygon is in the another ... ,
But I am keeping WA , could someone give me some test cases , thanks!

I submited my java code to problem Q100 3n+1 and got Time Limit Exceeded .

And it is interesting that your sample java code is TLE , too .

windows2k wrote:

Jan wrote:What to do now? Should I report it in Bugs and suggestions?

I get WA all the tiime.
And I passed the input/output above.
Could someone give more tricky input/output?
Thanks in advance

Edited.

I found my error :
I forgot to add eps when I change all double to int. (*100)

Does the input of problem 430 contain numbers that are larger than 2^32? No. I used normal 'int'. Can anyone who got acc give me some test cases? I can't find the error with my code .... thanks, :D Oh......... The input is tricky... There is empty line in the input ... Those who got WA should take ...

Jan wrote:

tsengct wrote:Does the input of problem 430 contain numbers that are larger than 2^32?

No. I used normal 'int'.

Can anyone who got acc give me some test cases?
I can't find the error with my code ....

thanks,

Some other flaws: 1. 5902457 SRX Time limit exceeded C++ 0.000 2007-09-08 10:06:56 I think it should be a submission error. 2. I submitted the same code twice, and get two very different runtimes 0.000s and 0.010s! Such big difference do not happen in old judge system. When I want to submit the pro...

Bappi_cuet wrote:I got Compilation error ok.
I go to my mail box there is no mail.
In this case how can i imagine which line gives Compilation error!!!!

You can use your eye to examine .

When I got CE , the problem is always that I forgot including something.

SRX wrote:I got time limit exceed ...

Can anyone give me some hints to find out vertex points of area which problem asks ...


thanks ...

I have tested some "simple" test cases , but still got WA,
can anyone who got ac give me some complex test cases ?

thanks...

I got time limit exceed ...

Can anyone give me some hints to find out vertex points of area which problem asks ...


thanks ...

sorry , I have passed the all test cases above ,
can someone give me some test cases ?

thanks

temper_3243 wrote:Hints needed , do we have a recurrence relation for this problem ?

you can think about it , if you borrow two bottles to get more one drink , then what is the cost of the "more one drink" ?

Jan wrote:I think the best solution is O(n^3).

I heard from someone that there exists a solution using
stack , and its running time is O(n^2) .

I can't find out it .

Can someone give me some link about that ?
thanks!

sakhassan wrote:still no clue!!!!!!!!!! still RTE

ok , your "char hash[M][N]; " , if we increase the size of N to
1000000 , what will happen ??

think about it , maybe you shoud find a better solution !

to sakhassan :
your "char str[N]" may be too small to read input ,
I guess the reason should be that