ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
Discussion of Problem
1994
. The Emperor's plan
Show all threads
Hide all threads
Show all messages
Hide all messages
Can't understand the test case
BUET_Bats
1994
. The Emperor's plan
12 Nov 2013 17:59
2
Can't understand the test case
BUET_Bats
26 Oct 2013 15:48
Can anyone please describe the test case? How can it be as low as 0.66667?
Re: Can't understand the test case
Fernando Fonseca
12 Nov 2013 17:59
- First night one good senator dies. We have 2 good senators and 1 spy.
- First day senators choose to kill 2 people. They have a 66.6% chance that they get the spy and a good guy remains, 33.3% chance that the spy lives.
is the dp ?
twocoldz
1994
. The Emperor's plan
8 Nov 2013 14:11
2
is the dp ?
twocoldz
1 Nov 2013 11:01
I use the dp to solve this problem. but always wa #2.
who can help me?
where i need to pay attention?
Re: is the dp ?
Antipov Andrew [Samara SAU]
8 Nov 2013 14:11
Yes, it is the dp. I also get wa #2, but in my case WA means runtime error. After fixing this bug(IndexOutOfRangeException) i get AC.
What if there are more spies than non-spies?
Bruce Merry
1994
. The Emperor's plan
26 Oct 2013 15:20
1
What if there are more spies than non-spies?
Bruce Merry
26 Oct 2013 15:20
If K > N - K, how can every spy kill exactly one non-spy?
New topic
Style:
flat
|
tree
|
nested
Thread Order:
bubble
|
fixed
© 2000–2024
Timus Online Judge Team
. All rights reserved.