Codeforces - 1264C - Beautiful Mirrors with queries - probability expectation dp

The probability of a hard to expect dp, E spent a long time to learn how to do div2, but this question is another try.

https://codeforces.com/contest/1264/problem/C

To set \ (dp_i \) represents the \ (I \) lattice through a desired number of times, so \ (n-dp_ {} =. 1. 1 + \) .

https://www.cnblogs.com/suncongbo/p/11996219.html