| # | User | Rating |
|---|---|---|
| 1 | tourist | 3857 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 162 |
| 3 | Qingyu | 159 |
| 3 | Dominater069 | 159 |
| 5 | atcoder_official | 157 |
| 6 | Um_nik | 153 |
| 6 | adamant | 153 |
| 8 | djm03178 | 151 |
| 8 | luogu_official | 151 |
| 10 | awoo | 147 |
An interesting problem that I couldn't solve
Hi everyone.
Please help me to solve this problem.
You are given a binary string s which is permutation of 0000000000000001111111111111111 (15 0s and 16 1s), you should find x such that s is lexiographic xth permutation of 0000000000000001111111111111111.
