Codeforcess solution 1372-A A. Omkar and Completion ,C++, Java, Js and Python

Algorithm

You have been blessed as a child of Omkar. To express your gratitude, please solve this problem for Omkar!

An array $a$ of length $n$ is called complete if all elements are positive and don't exceed $1000$ , and for all indices $x$ , $y$ , $z$ ( $1 \leq x, y, z \leq n$ ), $a_{x} + a_{y} \neq a_{z}$ (not necessarily distinct).

You are given one integer $n$ . Please find any complete array of length $n$ . It is guaranteed that under given constraints such array exists.

Input

Each test contains multiple test cases. The first line contains $t$ ( $1 \leq t \leq 1000$ ) — the number of test cases. Description of the test cases follows.

The only line of each test case contains one integer $n$ ( $1 \leq n \leq 1000$ ).

It is guaranteed that the sum of $n$ over all test cases does not exceed $1000$ .

Output

For each test case, print a complete array on a single line. All elements have to be integers between $1$ and $1000$ and for all indices $x$ , $y$ , $z$ ( $1 \leq x, y, z \leq n$ ) (not necessarily distinct), $a_{x} + a_{y} \neq a_{z}$ must hold.

If multiple solutions exist, you may print any.

Example
input
Copy
2
5
4
output
Copy
1 5 3 77 12
384 384 44 44

Note

It can be shown that the outputs above are valid for each test case. For example, $44 + 44 \neq 384$ .

Below are some examples of arrays that are NOT complete for the 1st test case:

$[1, 2, 3, 4, 5]$

Notice that $a_{1} + a_{2} = a_{3}$ .

$[1, 3000, 1, 300, 1]$

Notice that $a_{2} = 3000 > 1000$ .

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include<bits/stdc++.h>
using namespace std;


#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int t;
  cin>>t;
  while(t--){
    int n;
    cin>>n;
    for(int i = 0; i < n; i++){
      cout<<1<<" ";
    }
    cout<<endl;
  }

}

Copy The Code & Try With Live Editor

Input

–

cmd

2
5
4

Output

–

cmd

1 5 3 77 12
384 384 44 44

Demonstration

Codeforcess solution 1372-A A. Omkar and Completion ,C++, Java, Js and Python, 1372-A,Codeforcess solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution

Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+

Try With Live Editor

Category - Codeforces Online Judge Maniruzzaman Akash 1 year ago 380 0