{"problem":{"name":"Many Swaps Sorting","description":{"content":"Snuke has a sequence $p$, which is a permutation of $(0,1,2, ...,N-1)$. The $i$\\-th element ($0$\\-indexed) in $p$ is $p_i$. He can perform $N-1$ kinds of operations labeled $1,2,...,N-1$ any number of","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"asaporo2_b"},"statements":[{"statement_type":"Markdown","content":"Snuke has a sequence $p$, which is a permutation of $(0,1,2, ...,N-1)$. The $i$\\-th element ($0$\\-indexed) in $p$ is $p_i$.\nHe can perform $N-1$ kinds of operations labeled $1,2,...,N-1$ any number of times in any order. When the operation labeled $k$ is executed, the procedure represented by the following code will be performed:\n\nfor(int i=k;i<N;i++)\n    swap(p\\[i\\],p\\[i-k\\]);\n\nHe would like to sort $p$ in increasing order using between $0$ and $10^{5}$ operations (inclusive). Show one such sequence of operations. It can be proved that there always exists such a sequence of operations under the constraints in this problem.\n\n## Constraints\n\n*   $2 \\leq N \\leq 200$\n*   $0 \\leq p_i \\leq N-1$\n*   $p$ is a permutation of $(0,1,2,...,N-1)$.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$p_0$ $p_1$ $...$ $p_{N-1}$\n\n## Partial Scores\n\n*   In the test set worth $300$ points, $N \\leq 7$.\n*   In the test set worth another $400$ points, $N \\leq 30$.\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"asaporo2_b","tags":[],"sample_group":[["5\n4 2 0 1 3","4\n2\n3\n1\n2\n\n*   Each operation changes $p$ as shown below:\n\n![image](https://atcoder.jp/img/asaporo2/9f3b51eb1fe742848f407bdeb7b772e1.png)"],["9\n1 0 4 3 5 6 2 8 7","11\n3\n6\n1\n3\n5\n2\n4\n7\n8\n6\n3"]],"created_at":"2026-03-03 11:01:14"}}