RPSSL - Rock-Paper-Scissors-Lizard-Spock
Daniel enjoys watching TV series. One of his favorite is "The Big Bang Theory". The main characters of this series are: Sheldon – genius theoretical physicist, his friend Leonard – talented experimental physicist, their attractive, blonde neighbor Penny, and also their friends an aerospace engineer Howard and a particle astrophysicist Rajesh.
One time Rajesh tells Sheldon:
“I'll tell you what. How about we go rock-paper-scissors?”
“Ooh”, – Sheldon replies – “I don't think so. Anecdotal evidence suggests that in the game of rock-paper-scissors, players familiar with each other will tie 75 to 80% of the time due to the limited number of outcomes. I suggest rock-paper-scissors-lizard-Spock”.
“It's very simple. Scissors cuts paper. Paper covers rock. Rock crushes lizard. Lizard poisons Spock. Spock smashes scissors. Scissors decapitates lizard. Lizard eats paper. Paper disproves Spock. Spock vaporizes rock. And as it always has, rock crushes scissors”.
“Okay, I think I got it”.
And the friends decided to play rock-paper-scissors-lizard-Spock. And we would determine what the probability that Rajesh beats Sheldon in this game. We know the probabilities that any of the friends choose any object in the game. Also we know that they play till two wins, so the winner of the game is the person who first wins two rounds.
The first line of input contains the number t - the number of tests. Next comes the description of t tests. Each test case consists of two lines. The first line contains five integers RR, RSc, RP, RL, RSp – the probabilities that Rajesh chooses rock, scissors, paper, lizard or Spock respectively. The second line contains five integers SR, SSc, SP, SL, SSp – the probabilities that Sheldon chooses rock, scissors, paper, lizard or Spock respectively. (Note: the order of the objects in the input is rock, scissors, paper, lizard, Spock. The original problem is in Russian and we have scissors before paper in Russian variant of the game. Otherwise the rules are the same.)
1 <= t <= 500
0 <= RR, RSc, RP, RL, RSp <= 100, RR + RSc + RP + RL + RSp = 100
0 <= SR, SSc, SP, SL, SSp <= 100, SR + SSc + SP + SL + SSp = 100
For each test case print the probability that Rajesh beats Sheldon in percent rounded to the nearest integer.
Input: 2 10 20 30 40 0 10 10 10 10 60 20 20 20 20 20 20 20 20 20 20 Output: 66 50
No offense, I perceive that perhaps, based on the probabilities, given as an input in the quoted example, the Rajesh's winning probability as the output should be 55 and 40. Tell me if I'm wrong.
Yes. If a tie (for a whole round) is possible then it's also certain and thus Rajesh can't win.
so each game consists of 2 or 3 non-tie rounds ?Last edit: 2010-03-26 12:33:09
Carlos Eduardo Rodrigues Alves [USJT]:
Well, here is a case where the game never ends:
yes it should be 67...
If P1=66.65..., shouldn't 67 be the answer?
well you should calculate the probability that Rajesh wins... what is this probability if the game never ends?.. =P
What should we print if the game never ends?