codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1930B.md (1997B)


      1 Source: https://codeforces.com/problemset/problem/1930/B
      2 
      3 B. Permutation Printing
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 You are given a positive integer $n$.
     22 
     23 Find a permutation$^\dagger$ $p$ of length $n$ such that there do not exist two distinct indices $i$ and $j$ ($1 \leq i, j \lt n$; $i \neq j$) such that $p_i$ divides $p_j$ and $p_{i+1}$ divides $p_{j+1}$.
     24 
     25 Refer to the Notes section for some examples.
     26 
     27 Under the constraints of this problem, it can be proven that at least one $p$ exists.
     28 
     29 $^\dagger$ A permutation of length $n$ is an array consisting of $n$ distinct integers from $1$ to $n$ in arbitrary order. For example, $[2,3,1,5,4]$ is a permutation, but $[1,2,2]$ is not a permutation ($2$ appears twice in the array), and $[1,3,4]$ is also not a permutation ($n=3$ but there is $4$ in the array).
     30 
     31 Input
     32 
     33 Each test contains multiple test cases. The first line contains a single integer $t$ ($1 \leq t \leq 10^3$) — the number of test cases. The description of the test cases follows.
     34 
     35 The first line of each test case contains a single integer $n$ ($3 \leq n \leq 10^5$) — the length of the permutation $p$.
     36 
     37 It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$.
     38 
     39 Output
     40 
     41 For each test case, output $p_1, p_2, \ldots, p_n$.
     42 
     43 If there are multiple solutions, you may output any one of them.
     44 
     45 Example
     46 
     47 Input
     48 
     49 ```
     50 2
     51 
     52 4
     53 
     54 3
     55 ```
     56 
     57 Output
     58 
     59 ```
     60 4 1 2 3
     61 1 2 3
     62 ```
     63 
     64 Note
     65 
     66 In the first test case, $p=[4,1,2,3]$ is a valid permutation. However, the permutation $p=[1,2,3,4]$ is not a valid permutation as we can choose $i=1$ and $j=3$. Then $p_1=1$ divides $p_3=3$ and $p_2=2$ divides $p_4=4$. Note that the permutation $p=[3, 4, 2, 1]$ is also not a valid permutation as we can choose $i=3$ and $j=2$. Then $p_3=2$ divides $p_2=4$ and $p_4=1$ divides $p_3=2$.
     67 
     68 In the second test case, $p=[1,2,3]$ is a valid permutation. In fact, all $6$ permutations of length $3$ are valid.