Codeforces 1027E Inverse Coloring 【DP】

Codeforces 1027E Inverse Coloring

---

题目链接

---

---

 #include<bits/stdc++.h>
 using namespace std;
 #define N 1010
 #define LL long long
 #define Mod 998244353
 int n,k;
 LL dp[N][N],ans=;
 LL sum[N][N];
 int main(){
     cin>>n>>k;
     dp[][]=;
     for(int i=;i<=n;i++)
         for(int j=;j<=i;j++)
             for(int p=;p<=j;p++)
                 dp[i][j]=(dp[i][j]+dp[i-p][min(j,i-p)])%Mod;
     for(int i=n;i>=;i--)dp[n][i]=(dp[n][i]-dp[n][i-]+Mod)%Mod;
     for(int i=;i<=n;i++)
         for(int j=;j*i<k;j++)
             ans=(ans+dp[n][i]*dp[n][j]%Mod)%Mod;
     ans=(ans*)%Mod;
     printf("%lld",ans);
     return ;
 }