Рабочее место участника

Теория вероятностей
Динамическое программирование и запоминающие функции
Олимпиадные задачи на английском языке

31/03/2007

Тренировка (задачи ACM ICPC SE RC 2002) (E)

Ограничения: время – 2s/4s, память – 32MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод
Послать решение Blockly Посылки Темы Где Обсудить (0)

• the match is played by two teams: A and B;
  
• the first team to win `K` games in a match, wins the match;
  
• each game consists of rounds; each round is won by one of the teams, and the team adds one point to its score for the current game;
  
• the first team to win `L` points in a game, wins the game;
  
• if team A serves the ball in a round, it has `P_a`% chance to win the round (and `(100\ -\ P_a)`% to loose it);
  
• if team B serves the ball in a round, it has `P_b`% chance to win the round (and `(100\ -\ P_b)`% to loose it);
  
• if a round is not the first in a game, the ball in the round is served by the team that won the last round;
  
• if a game is not the first in a match, the ball in the first round of the game is served by the team that did not served the ball in the first round of the previous game;
  
• both teams have an equal chance to serve the ball in the first round of the very first game of a match.

2
100 50 1 3
100 1 1 1

93.8
99.5