307547: CF1372A. Omkar and Completion
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Omkar and Completion
题意翻译
你作为 $Omkar$ 的一个孩子而受到祝福。为了表达你的感激之情,请为 $Omkar$ 解决这个问题! - 有一个正整数 $n (1\le n\le 10^3)$ ,求一个长度为 $n$ 的数组 $a$. - 对于每个 $x,y,z(1\le x,y,z\le n)$满足 $a_x + a_y \neq a_z$($x,y,z$可能相等). - 输入包含 $t (1\le t\le 10^3)$ 组数据,每组数据包含一个整数 $n$ . - 输出 $t$ 行,每行一个长度为 $n$ 的数组$a$(保证有解,如有多个解,输出任意一个).题目描述
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.输入输出格式
输入格式
Each test contains multiple test cases. The first line contains $ t $ ( $ 1 \le t \le 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 $ .
输出格式
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.
输入输出样例
输入样例 #1
2
5
4
输出样例 #1
1 5 3 77 12
384 384 44 44