The first line of input contains an integer ‘T’ denoting the number of test cases. The test cases follow.
The first line of each test case contains a single integer ‘N’, given to Ninja and his friends.
For each test case, print the binary equivalent of the given number.
Print the output of each test case in a separate line.
You are not required to print the expected output; it has already been taken care of. Just implement the function.
1 <= T <= 10 ^ 3
0 <= N <= 10 ^ 6
Time Limit: 1 sec
The steps are as follows:
First N
Can You Print
Print Name
Print Name
Print Name
Print Name
Print Name
Print Fibonacci Series
Print Fibonacci Series
Print Fibonacci Series
Print Fibonacci Series
Print Fibonacci Series
Print Fibonacci Series
Count Repeating Digits