/*
10
180 10 90*2
2610 180 10 900*3-90
34200 2610 180 10 9000*4-900*2
423000 34200 2610 180 10 90000*5-9000*3
5040000 423000 34200 2610 180 10 900000*6-90000*4
*/
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e5+10;
int n;
typedef long long ll;
const ll mod=998244353;
int main() {
cin>>n;
ll a=900,b=90;
vector<ll>v;
v.push_back(10);
v.push_back(180);
for(int i=3;i<=n;i++)
{
ll ans=(a*i%mod-b*(i-2)%mod+mod)%mod;
v.push_back(ans);
a=a*10%mod;
b=b*10%mod;
}
for(int i=n-1;i>=0;i--)
cout<<v[i]<<" ";
}
Count The Blocks CodeForces - 1327E oeis
原文：https://www.cnblogs.com/QingyuYYYYY/p/12557083.html