核心内容摘要
5步搞定中文语义检索：StructBERT WebUI快速上手
time limit per test1 secondmemory limit per test256 megabytesA positive integer x is a perfect root if there exists an integer y such that y√x. For example, 5 is a perfect root because 25−−√
For each test case, output n distinct perfect roots. Note that the values only need to be distinct within each test case; you can use the same value in different test cases.InputThe first line of the input contains a single integer t (1≤t≤
— the number of test cases.The only line of each test case contains an integer n (1≤n≤
— the number of perfect roots to output.OutputFor each test case, output n distinct perfect roots. Each perfect root x must be in the range 1≤x≤
ExampleInputCopy3 1 2 5OutputCopy1 2 4 2 102 43 1 21NoteFor the first test case:1 is a perfect root because 1–√
For the second test case:2 is a perfect root because 4–√
4 is a perfect root because 16−−√
解题说明水题直接输出1-n即可。
每个数肯定都符合条件。
#includestdio.h int main() { int t; scanf(%d, t); while (t--) { int n; scanf(%d, n); for (int i 1; i n; i) { printf(%d , i); } printf(\n); } return 0; }