This post is all about the solution of the "Avoid Squares Please" Starters 63 (Rated till 6-stars) Problem Statement.

Building Race Codechef solution

Codechef 



Problem Statement:

You have been given the numeric NN.

Print a possible combination PP of [1,2, ldots, N][1,2,...,N] that fulfill the necessary criteria:

P i times P i+1P for any index I (1 leq I lt N)i (1iN).

isn't an exact square.

Users may publish any of the right answers if there are more than one.

A possible combination of [1, 2, ldots, N][1,2,...,N] is a numeric reshuffling.

Format of Input :

The number of instances is indicated by a single numeric TT in the first line of input. The following is a list of TT test cases.
Evey test case's 1st line contains an integer NN - the duration of the required possible combination.


Format of the Output :

Publish NN space-separated integer arithmetic chosen to represent this same valid permutation on a single line for every testing ground.

Users may publish any of the right answers if there is more than one.


Also Check this out:-

One-XOR Deletions Starters 63 (Rated till 6-stars) Problem Solution. Click Here
Packing Books Starters 63 (Rated till 6-stars) Problem Solution Click Here

Also Read :- Top Programming Languages of 2022 Click Here

Solution of the Problem: Click Here