Search found 63 matches

by SRX
Mon Sep 14, 2009 5:08 pm
Forum: Volume 116 (11600-11699)
Topic: 11666 - Logarithms
Replies: 16
Views: 6133

Re: 11666 Logarithms WA again and agian

input:

Code: Select all

9
8
7
0

9

output

Code: Select all

2 -0.21801755
2 -0.08268227
2 0.05265302
notice that -1<x<1
by SRX
Tue Sep 08, 2009 8:18 pm
Forum: Volume 116 (11600-11699)
Topic: 11665 - Chinese Ink
Replies: 2
Views: 2220

11665 - Chinese Ink

I have considered that one polygon is in the another ... ,
But I am keeping WA , could someone give me some test cases , thanks!
by SRX
Sun Jan 20, 2008 6:55 pm
Forum: Bugs and suggestions
Topic: java
Replies: 1
Views: 1282

java

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 .
by SRX
Mon Sep 24, 2007 6:59 pm
Forum: Volume 112 (11200-11299)
Topic: 11284 - Shopping Trip
Replies: 32
Views: 13884

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)
by SRX
Sat Sep 08, 2007 7:12 pm
Forum: Volume 4 (400-499)
Topic: 430 - Swamp County Supervisors
Replies: 8
Views: 3191

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 ...
by SRX
Sat Sep 08, 2007 4:50 pm
Forum: Volume 4 (400-499)
Topic: 430 - Swamp County Supervisors
Replies: 8
Views: 3191

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, :D
by SRX
Sat Sep 08, 2007 3:23 pm
Forum: Bugs and suggestions
Topic: New Time Limit is 1 second?
Replies: 8
Views: 3206

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...
by SRX
Sat Sep 08, 2007 3:17 pm
Forum: FAQ
Topic: Borring System
Replies: 20
Views: 17736

Re: Compilation error

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.
by SRX
Mon Sep 03, 2007 4:03 am
Forum: Volume 112 (11200-11299)
Topic: 11265 - The Sultan's Problem
Replies: 13
Views: 5990

Re: 11265 - The Sultan

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...
by SRX
Sun Sep 02, 2007 2:53 pm
Forum: Volume 112 (11200-11299)
Topic: 11265 - The Sultan's Problem
Replies: 13
Views: 5990

11265 - The Sultan's Problem

I got time limit exceed ...

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


thanks ...:)
by SRX
Sun Mar 11, 2007 5:15 pm
Forum: Volume 111 (11100-11199)
Topic: 11183 - Teen Girl Squad
Replies: 28
Views: 13005

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

thanks :oops:
by SRX
Tue Jan 02, 2007 6:57 am
Forum: Volume 111 (11100-11199)
Topic: 11150 - Cola
Replies: 43
Views: 22754

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" ?
by SRX
Mon Dec 25, 2006 8:02 am
Forum: Algorithms
Topic: Classic matrix problem
Replies: 5
Views: 2861

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!
by SRX
Mon Dec 04, 2006 4:59 pm
Forum: Volume 9 (900-999)
Topic: 902 - Password Search
Replies: 68
Views: 32027

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

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

think about it , maybe you shoud find a better solution !
:D
by SRX
Mon Dec 04, 2006 9:06 am
Forum: Volume 9 (900-999)
Topic: 902 - Password Search
Replies: 68
Views: 32027

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

Go to advanced search