0
点赞
收藏
分享

微信扫一扫

Magic Sequence(NOIOPJENGLISH03)

扒皮狼 2022-01-16 阅读 29
c++

Magic Sequence

Magic Sequence | JXNUOJ

1000ms 65536K

描述:

Find a sequence of N numbers. Each number is equal to the count of (its index minus 1) in the sequence.

找到n个有序数字,每个数字相当于序列中(其索引减1)的计数

输入:

One positive integer N (N <= 10).

一个正整数n

输出:

N lines: the i-th line contains one integer indicating the i-th number in the sequence.

n行:第i行包含一个正整数表示第i个在序列中的数字

样例输入:

4

样例输出:

1
2
1
0
举报

相关推荐

0 条评论