## Editorial for Mock CCC '24 Contest 1 S2 - Owen the Toucan

Remember to use this editorial

**only**when stuck, and**not to copy-paste code from it**. Please be respectful to the problem author and editorialist.**Submitting an official solution before solving the problem yourself is a bannable offence.**Author:

For this problem, we must construct a permutation , by using integers from to such that the number of unique integers obtained from calculating the GCD of the element at the position and the element at the position of array is exactly .

There are many different strategies to construct such an array, and one of the possible solutions will be discussed in this editorial.

## Subtask 1

If , we can create an array by set for all where , and .If , we can create an array by set for all where .

## Subtask 2

We can split the creation of the array into two separate loops, one covering positions from to , and the other covering positions from to .The implementation details are left as an exercise for the reader.

**Time Complexity:**

## Comments