Search found 192 matches

by Red Scorpion
Wed Apr 07, 2004 11:01 am
Forum: Volume 3 (300-399)
Topic: 323 - Jury Compromise
Replies: 10
Views: 3200

hello, everyone. :lol: :lol:

I kept getting WA, can someone provide more testcase. :cry:

Thanks
by Red Scorpion
Mon Mar 08, 2004 5:38 pm
Forum: Volume 103 (10300-10399)
Topic: 10355 - Superman
Replies: 9
Views: 3280

I'm sad no body help me... :cry: :cry: How to avoid using sqrt, since my equation is like this: superman path through sphere percentage = -------------------------------------- total superman path sqrt(s1) + sqrt(s2) + sqrt(s3) + .... = --------------------------------------------- sqrt((x2-x1)^2 + ...
by Red Scorpion
Mon Mar 08, 2004 2:02 pm
Forum: Volume 106 (10600-10699)
Topic: 10624 - Super Number
Replies: 12
Views: 3602

this is my output :

Code: Select all

Case 1: 1020005640
Case 2: -1
Case 3: 10805480103600001800
Case 4: 3608528850368400786036725
Case 5: 104052249072240066402
Case 6: 10000200606
Case 7: 75320424003636007240884008
Case 8: 10000200606
Case 9: 10000000020010563060
Good Luck :D :D :D :D
by Red Scorpion
Thu Jan 15, 2004 6:17 pm
Forum: Volume 103 (10300-10399)
Topic: 10355 - Superman
Replies: 9
Views: 3280

10355-Superman got WA

Hello everyone. I tried to solve this problem, but got WA - maybe precission error problem. I used the formula: s = u.dp +- sqrt((u.dp)^2 - |dp|^2 + r^2) to find the length through sphere region. s = length to sphere region. u = 'normalize' vector starting and ending superman's path. dp = vector bet...
by Red Scorpion
Thu Jan 15, 2004 8:39 am
Forum: Volume 3 (300-399)
Topic: 380 - Call Forwarding
Replies: 3
Views: 3542

380-Call Forwarding, What is the trick?

I got WA many times in this prob, what is the trick? :lol:
by Red Scorpion
Mon Jan 12, 2004 2:16 pm
Forum: Volume 102 (10200-10299)
Topic: 10283 - The Kissing Circles
Replies: 13
Views: 5605

Hi, Dima :lol: :lol: My AC code, give: 10.0000000000 0.0000000000 0.0000000000 5.0000000000 0.0000000000 157.0796326795 4.6410161514 3.4732652470 107.6854162259 4.1421356237 14.7279416563 83.8264899217 3.7019190816 29.7315551092 69.1625632742 3.3333333333 45.6568837582 59.0628713615 304.5417046668 2...
by Red Scorpion
Mon Jan 12, 2004 7:53 am
Forum: Volume 105 (10500-10599)
Topic: 10599 - Robots(II)
Replies: 27
Views: 10007

Hi, I used 'long long' to solved this problem.
But maybe the judge data fit into 64-signed integer.
by Red Scorpion
Mon Jan 05, 2004 2:04 pm
Forum: Volume 7 (700-799)
Topic: 726 - Decode
Replies: 36
Views: 9754

Hi, nobody helpp.. :x :x
by Red Scorpion
Mon Jan 05, 2004 1:54 pm
Forum: Volume 6 (600-699)
Topic: 668 - Parliament
Replies: 12
Views: 4324

Hi, junjieliang.

I have the same problem as you did. I don't understand exactly what's the want. Some one please help.. :x
by Red Scorpion
Thu Jan 01, 2004 10:19 am
Forum: Volume 105 (10500-10599)
Topic: 10590 - Boxes of Chocolates Again
Replies: 20
Views: 7436

ooops, sorry I misstype the equation. the equation should be the same as ghost77 dimen.

PS: I think it is a spoiler so please remove it.

Best Regards,
RS
by Red Scorpion
Wed Dec 31, 2003 2:56 pm
Forum: Volume 105 (10500-10599)
Topic: 10590 - Boxes of Chocolates Again
Replies: 20
Views: 7436

Hi, all.

My equation is:

Code: Select all

cutted
should I reduce the paramter into one ?

Happy new year.

Thanks.
by Red Scorpion
Wed Dec 31, 2003 7:15 am
Forum: Volume 105 (10500-10599)
Topic: 10590 - Boxes of Chocolates Again
Replies: 20
Views: 7436

10590 - Boxes of Chocolates Again

I know the recurence equation to solve this problem, but since n is very big (n<=5000), I can't precalculate the result.
Is this problem need an explicit equation?

Regards,
RS[/b]
by Red Scorpion
Mon Dec 29, 2003 7:20 am
Forum: Volume 105 (10500-10599)
Topic: 10599 - Robots(II)
Replies: 27
Views: 10007

After rejudge I got AC, thanks.
by Red Scorpion
Sat Dec 27, 2003 2:52 pm
Forum: Volume 105 (10500-10599)
Topic: 10599 - Robots(II)
Replies: 27
Views: 10007

10599 - Robots(II)

Hi,..

I used DP to solve this, but always got WA.
Is there any trick in this prob?
can someone who have got AC give me some test cases?

Thanks.
by Red Scorpion
Sat Dec 27, 2003 2:24 pm
Forum: Volume 105 (10500-10599)
Topic: 10596 - Morning Walk
Replies: 41
Views: 14603

10596 - Morning Walk

Hi, all.

I get many WA in this problem.
My algo is: (euler cycle)
1. Check if the graph is connected.
2. for all vertex indegree must be the same as outdegree.
3. if number of road = 0, then print "Not conneted".

Am I wrong?

Thanks, for help.
Best Regards,
RS

Go to advanced search