Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int dp[51][3001];
- int main()
- {
- int n,m,k,j,j1,i;
- cin>>n>>m>>k;
- dp[0][0]=1;
- for(j=1;j<=n;j++){
- for(i=1;i<=k;i++){
- for(j1=1;j1<=m;j1++){
- if(i>=j1)
- dp[j][i]+=dp[j-1][i-j1];dp[j][i]%=998244353;
- }
- }
- }
- long long s=0;
- for(i=1;i<=k;i++){
- s+=1ll*dp[n][i];s%=998244353;
- }
- cout<<s;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement