Positive Prefixes Codechef December long challenge solution | Codechef December long challeng editorial

If you haven't completed the codechef prefixes december long challange then here are some hint given you csn go throught thease statements.

Problem statement

this Problem Positive prefix taken from CodeChef December long challenge.Let's read Problem statement.

You are given two positive integers N$N$ and K$K$, where K≤N$K\le N$. Find a sequence A1,A2,…,AN$A_1,A_2,\dots ,A_N$ such that:

• for each valid i$i$, Ai$A_i$ is either i$i$ or −i$-i$
• there are exactly K$K$ values of i$i$ such that 1≤i≤N$1\le i\le N$ and A1+A2+…+Ai>0$A_1+A_2+\dots +A_i>0$

If there are multiple solutions, you may print any one of them. It can be proved that at least one solution always exists.

Input

• The first line of the input contains a single integer T$T$ denoting the number of test cases. The description of T$T$ test cases follows.
• The first and only line of each test case contains two space-separated integers N$N$ and K$K$.

Output

For each test case, print a single line containing N$N$ space-separated integers A1,A2,…,AN$A_1,A_2,\dots ,A_N$.

Constraints

• 1≤T≤1,000$1\le T\le 1,000$
• 1≤K≤N≤1,000$1\le K\le N\le 1,000$

Subtasks

Subtask #1 (10 points): N≤10$N\le 10$

Subtask #2 (90 points): original constraints

Example Input

3

3 3

Example Output

1 2 3

Resources & hint

 

n=5 k=1  (k<n/2)so one of the solution could be

o/p- -1 2 -3 -4 -5

n=3 k=3 (print same)

o/p- 1 2 3

n=10  k=6 (k>n/2) so one of the solution could be

o/p- -1 2 -3 4 -5 6 -7 8 -9 10

 

explanation:

-1+2  >0

-1+2-3+4  >0

-1+2-3+4-5+6   >0

-1+2-3+4-5+6-7+8  >0

-1+2-3+4-5+6-7+8-9  >0

-1+2-3+4-5+6-7+8+9+10  >0

 For more hint go -> here

Tags:

Codechef december long challange

codechef solutions

codechef positive prefixes solution

codechef hail xor december long challange solutions

Square root of lca conv december codechef long challange solution