PivotOJ

Loot Chest

시간 제한: 1000ms메모리 제한: 1024MB출처: ICPC Rocky Mountain Regional 2021BOJ 24757

문제

Your favorite online game has a prize system. After each match you win, there is a P%P\% chance you will receive a prize. This value PP changes over time:

  • every time you lose a match, PP increases by ΔL\Delta_L,
  • every time you win a match but fail to receive a prize, PP increases by ΔW\Delta_W, and
  • every time you win a match and receive a prize, PP is set to 00.

Whenever PP is increased, it is capped at 100100. That is, if PP is to be increased by Δ\Delta, PP increases to min(P+Δ,100)\min(P+\Delta, 100).

The developers just revealed one of the prizes this season is a silverback gorilla suit with star-shaped sunglasses. You want it! Each prize has a G%G\% chance of being this gorilla suit.

You start with P=0%P = 0\%. You have an L%L\% chance of losing each match you play. Given ΔL,ΔW,G,\Delta_L, \Delta_W, G, and LL, compute the expected number of matches you will have to play until you obtain the silverback gorilla suit.

For example, in the first sample case you win every match you play and are guaranteed to receive a prize every 22 matches. Each prize has a 50%50\% chance of being the gorilla suit. So you expect to obtain the gorilla suit after receiving 22 prizes. Thus, in expectation, it takes 44 matches to obtain the gorilla suit.

입력

The input consists of a single line containing four integers ΔL\Delta_L (1ΔL1001 \leq \Delta_L \leq 100), ΔW\Delta_W (1ΔW1001 \leq \Delta_W \leq 100), GG (1G1001 \leq G \leq 100), and LL (0L990 \leq L \leq 99), which are described above.

출력

Display the expected number of matches you will play before you obtain the gorilla suit. Your answer should have an absolute or relative error of at most 10610^{-6}.

예제

예제 1

입력
1 100 50 0
출력
4

예제 2

입력
50 50 100 25
출력
2.8333333333333333333

예제 3

입력
1 100 10 0
출력
20

예제 4

입력
2 3 10 80
출력
197.00570671995630567
코드를 제출하려면 로그인하세요.