НачалоПодразделы
Другие разделы
| 1034. Gangs |
| 1036. The Dragon of Loowater |
| 1037. Tournament |
| 1038. Wedding |
| 1039. Exchange Rates |
| 1040. Conformity |
| 1041. Pseudoprime numbers |
| 1042. Friend or Foe? |
| 1043. Carpool |
Дата и время
06/12/2025 04:41:03
1035. Smeech
Smeech
Грамматики, рекурсивный разборОлимпиадные задачи на английском языке
| 03/07/2008 | Лето 2008 дорешивание (12B) |
| 28/07/2008 | Лето 2008 - 12 (B) |
| 24/07/2013 | Лето 2013-16 (командная) (B) |
Ограничения: время – 1s/2s, память – 64MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод 
Послать решение Blockly Посылки Темы Где Обсудить (0)
Professor Octastichs has invented a new programming language, Smeech.
An expression in Smeech may be a positive or negative integer, or
may be of the form `(p\ e_1\ e_2)`
where `p` is a real number between 0 and 1 (inclusive) and
`e_1` and `e_2` are Smeech expressions.
The value represented by a Smeech expression is as follows:
- An integer represents itself
- With probability `p`, `(p\ e_1\ e_2)` represents `x+y` where `x` is the value of `e_1` and `y` is the value of `e_2`; otherwise it represents `x-y`.
Given a Smeech expression, what is its expected value?
Input consists of several Smeech expressions, one per line, followed by a
line containing (). For each expression, output its expected value to
two decimal places.
Sample Input
7 (.5 3 9) ()
Output for Sample Input
7.00 3.00
