[Solution] Zero Ones Equal One Zeros CodeChef Solution

[Solution] Zero Ones Equal One Zeros CodeChef Solution

Kulyash believes in equality.
Given an integer N$N$, output a binary string of length N$N$ such that:

• The count of 01$01$ subsequences in the string is equal to the count of 10$10$ subsequences;
• The string has at least one occurrence of 0$0$ as well as 1$1$.

If multiple such strings exist, print any. Also, it is guaranteed that corresponding to the given input, an answer always exists.

Input Format

• First line will contain T$T$, number of test cases. Then the test cases follow.

Solution Click Below:-  CLICK HERE

• Each test case contains of a single line of input, an integer N$N$ - the length of the binary string.

Output Format

For each test case, output any binary string of length N$N$ satisfying the given conditions.

Determine the Score CodeChef Solution

Zero Ones Equal One Zeros CodeChef Solution

It is My Serve CodeChef Solution

Too many Floors CodeChef Solution

Equal by XORing CodeChef Solution

The Lost Array CodeChef Solution

Max Shift After XOR CodeChef Solution

Constraints

• 1≤T≤100$1\le T\le 100$
• 3≤N≤1000