No.1743 Permutation Code
Note
The problem setter has no intended solution for this problem.
We are eagerly waiting for some user to solve it.
Problem Statement
Noya-kun tried to pass down a permutation $P=(P_1,P_2,\dots ,P_N)$ of $(1,2,\dots ,N)$ to the distant future by encrypting it.
The permutation $P$ is encrypted by the following procedure.
You are given $C$.
Output one possibility for the permutation $P$ that Noya-kun tried to pass down, in base $10$, separated by spaces.
Constraints
0 and 1Input
$C$
Output
Output one possibility for the permutation $P$ that Noya-kun tried to pass down, in base $10$, separated by spaces.
Print a newline at the end.
Sample
Sample 1
Input
11100101
Output
3 4 2 1
Encrypting $P=(3,4,2,1)$ results in 11100101, so it is one of the candidates.
In this sample case, there is no answer other than 3 4 2 1.
Sample 2
Input
10100100111000011101101110010111111010010111010110001111100110010001110101
Output
20 19 16 14 13 12 11 7 2 18 3 10 1 8 15 9 4 17 6 5
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。
noya2