C. Crashing Competition Computer

You are writing code for a hackathon where you need to decode Binary ALGOL Punch Cards. You have already come up with the optimal solution and only need to type it out. The solution consists of \(c\) characters, and your typing speed is \(1\) character per time unit. However, your computer is prone to sudden crashes: after every character you type there is a probability of \(p\) that your computer crashes and you need to start over again. Recovering after a crash costs \(r\) time units, and you can then continue typing from the last point where you saved your code.

You can click "Save" at any time (which costs \(t\) time units) to save your code and to be able to restart from this point after crashes. Clicking "Save" will not cause your computer to crash.

Determine how many (expected) time units you need to complete the code. Note that the code should be saved after typing the last character.

The input consists of:
- One line with three integers \(c\), \(t\), and \(r\) (\(1 \leq c \leq 2000\), \(0 \leq t, r \leq 10^9\)), indicating the number of characters, the time cost of clicking "Save", and the time cost of recovering after a crash.
- One line with a floating-point number \(p\) (\(0.001 \leq p \leq 0.999\), with at most \(10\) digits after the decimal point), the probability that your computer crashes after a character press.

Output the expected number of time units you need to complete the code.

Your answer should have an absolute or relative error of at most \(10^{-6}\).

생성자가 기록되지 않았습니다.

출처 ICPC BAPC 2022