Printing Binary Array solution codechef

Consider a binary array �=�1,�2,…,��B=B1​,B2​,…,BM​ of length $M$. Being a binary array means that every ��Bi​ is either $0$ or $1$.
$Score(B)$ is defined as the number of indices $i$ $($where $1\le i<M)$ such that ��≠��+1Bi​=Bi+1​.

You are given a binary array �=�1,�2,…,��A=A1​,A2​,…,AN​ of length $N$. Print a binary array $C$ of length $N$ such that

• �≠�A=C, and
• $Score(A)=Score(C)$.

That is, print a binary array $C$ which is not identical to $A$, but has the same Score as that of $A$.

It can be proven that such a $C$ always exists.

Printing Binary Array solution codechef

• The first line of input contains a single integer $T$, denoting the number of test cases.
• Each test case consists of two lines of input:
  • The first line of each test case contains a single integer $N$ — the length of the binary array $A$.
  • The second line of each test case contains $N$ space-separated integers �1,�2,…,��A1​,A2​,…,AN​ representing the binary array $A$.

Output Format

For each test case, print $N$ space-separated integers �1,�2,…,��C1​,C2​,…,CN​ satisfying all the given conditions.

If there are multiple solutions, you can print any of them.

Constraints

Sample 1:

2
1
0
3
1 1 0

1
0 1 1

Explanation:

Testcase 1: The given array is $A=[0]$. $Score(A)=0$, since there are no indices such that ��≠��+1Ai​=Ai+1​. Therefore, we need to output another array of length $1$, whose Score is also 0. $C=[1]$ is the only such array, and we output it.

Testcase 2: The given array is $A=[1,1,0]$. $Score(A)=1$, since �2≠�3A2​=A3​. And it is the only such index. Therefore, we need to output another array of length $3$, whose Score is also 1. $C=[0,1,1]$ is one such array, and we output it. Note that there are other such arrays as well.