CF1327E.Count The Blocks

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You wrote down all integers from $0$ to $10^n - 1$ , padding them with leading zeroes so their lengths are exactly $n$ . For example, if $n = 3$ then you wrote out 000, 001, ..., 998, 999.

A block in an integer $x$ is a consecutive segment of equal digits that cannot be extended to the left or to the right.

For example, in the integer $00027734000$ there are three blocks of length $1$ , one block of length $2$ and two blocks of length $3$ .

For all integers $i$ from $1$ to $n$ count the number of blocks of length $i$ among the written down integers.

Since these integers may be too large, print them modulo $998244353$ .

输入格式

The only line contains one integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ).

输出格式

In the only line print $n$ integers. The $i$ -th integer is equal to the number of blocks of length $i$ .

Since these integers may be too large, print them modulo $998244353$ .

输入输出样例

输入#1
```
1
```
输出#1
```
10
```
输入#2
```
2
```
输出#2
```
180 10
```

首页