Submission #66209111

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#include"atcoder/all"
using namespace atcoder;
typedef modint998244353 mi;
using namespace std;
#define all(a) a.begin(),a.end()
#define compress(a) sort(all(a));a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
constexpr ll mod=998244353;
constexpr ll inf=3e18;

modint dp[102][102][102][102];

int main(){
	ll n,K,p;
	cin>>n>>K>>p;
	modint::set_mod(p);
	dp[0][0][0][0]=1;

	for(int i=0;i<n-1;i++){
		for(int j=0;j<=i;j++){
			for(int k=0;k<=i;k++){
				for(int l=0;l<=i;l++){
					dp[i+1][0][0][l+1]+=dp[i][j][k][l];
					dp[i+1][j+1][0][l+1]-=dp[i][j][k][l];
					dp[i+1][0][k+1][l+1]-=dp[i][j][k][l];
					dp[i+1][j+1][k+1][l+1]+=2*dp[i][j][k][l];
					dp[i+1][j+1][i+2][l+1]-=dp[i][j][k][l];
					dp[i+1][i+2][k+1][l+1]-=dp[i][j][k][l];
					dp[i+1][i+2][i+2][l+1]+=dp[i][j][k][l];
					dp[i+1][j+1][0][l]+=dp[i][j][k][l];
					dp[i+1][j+1][k+1][l]-=dp[i][j][k][l];
					dp[i+1][i+2][0][l]-=dp[i][j][k][l];
					dp[i+1][i+2][k+1][l]+=dp[i][j][k][l];
					dp[i+1][0][k+1][l]+=dp[i][j][k][l];
					dp[i+1][0][i+2][l]-=dp[i][j][k][l];
					dp[i+1][j+1][k+1][l]-=dp[i][j][k][l];
					dp[i+1][j+1][i+2][l]+=dp[i][j][k][l];
				}
			}
		}
		for(int j=0;j<=i;j++){
			for(int k=0;k<=i+1;k++){
				for(int l=0;l<=i+1;l++){
					dp[i+1][j+1][k][l]+=dp[i+1][j][k][l];
				}
			}
		}
		for(int j=0;j<=i+1;j++){
			for(int k=0;k<=i;k++){
				for(int l=0;l<=i+1;l++){
					dp[i+1][j][k+1][l]+=dp[i+1][j][k][l];
				}
			}
		}
	}

	modint ans=0;
	rep(j,n){
		rep(k,n){
			ans+=dp[n-1][j][k][K];
		}
	}
	cout<<ans.val()<<endl;

}

Submission Info

Judge Result