有趣的题

A. Specific Tastes of Andre

  • time limit :per test1 second
  • memory limit :per test256 megabytes
  • input:standard input
  • output:standard output

Andre has very specific tastes. Recently he started falling in love with arrays.

Andre calls an nonempty array b good, if sum of its elements is divisible by the length of this array. For example, array [2,3,1] is good, as sum of its elements — 6 — is divisible by 3, but array [1,1,2,3] isn't good, as 7 isn't divisible by 4.

Andre calls an array a of length n perfect if the following conditions hold:

Every nonempty subarray of this array is good.
For every .
Given a positive integer n, output any perfect array of length n. We can show that for the given constraints such an array always exists.

An array c is a subarray of an array d if c can be obtained from d by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.

Input
Each test contains multiple test cases. The first line contains the number of test cases t . Description of the test cases follows.

The first and only line of every test case contains a single integer n .

Output
For every test, output any perfect array of length n on a separate line.

Example

Input

3
1
2
4

Output

24
19 33
7 37 79 49

算法竞赛之路 文章被收录于专栏

整理、记录算法竞赛的好题

全部评论

相关推荐

09-29 16:59
已编辑
门头沟学院 Java
牛客96609213...:疯狂背刺,之前还明确设置截止日期,还有笔试,现在一帮人卡在复筛,他反而一边开启扩招,还给扩招的免笔试,真服了,你好歹先把复筛中的给处理了再说
投递大疆等公司10个岗位
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务