Submission #3272353

---

Source Code Expand

#include<bits/stdc++.h>
#define reg register
#define F(i,j,k) for(reg int i=(j);i<=(k);++i)
#define dF(i,j,k) for(reg int i=(j);i>=(k);--i)
using namespace std;
typedef long long ll;
int n,k;
const int mod=998244353;
const int MN=2005;
int C[MN<<1][MN<<1],pw[MN<<1];
inline ll add(ll a,ll b){a+=b;return a-(a>=mod?mod:0);}
inline ll solve(int i,int tot){
	reg int k2=min(k-i/2,(i-1)/2);reg int k1=k-(k2<<1)-((i&1)==0);
	reg ll res=0,pos=1;
	for(reg int j=k2;j+k1>0&&j>=0;j--,pos*=-1)
		res=add(res,pos*C[j+k1+tot-1][j+k1-1]%mod*pw[j]%mod*C[k2][j]%mod);
	return add(res,mod);
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin>>k>>n;C[0][0]=1;pw[0]=1;
	F(i,1,n<<1){
		C[i][0]=1;pw[i]=add(pw[i-1],pw[i-1]);F(j,1,i)C[i][j]=add(C[i-1][j-1],C[i-1][j]);
	}
	reg ll ans=0;
	F(i,2,k<<1){
		if(~i&1)ans=add(solve(i,n),solve(i,n-1));
		else ans=solve(i,n);
		cout<<ans<<endl;
	}
	return 0;
}

Submission Info

Judge Result