Educational Codeforces Round 84 (Rated for Div. 2) E. Count The Blocks（组合数学）

题目链接

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod= 998244353;
ll quick(ll a,ll b){ 
    ll ans=1;  
    a=a%mod;
    while(b!=0){
        if(b&1) ans=(ans*a)%mod;
        b>>=1;
        a=(a*a)%mod;
    }
    return ans;
}
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
	{
		ll ans=0;
		if(i==n) ans=10;
		if(i<n) ans=(ans+10*18*quick(10,n-i-1)%mod+mod)%mod;
		if(i<n-1) ans=(ans+10*81*(n-i-1)*quick(10,n-i-2)%mod+mod)%mod;
		printf("%lld ",ans);
	}
}