Submission #54594535

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
#include <bits/stdc++.h>
using namespace std;
const int mod=998244353;
int n,a,c[1010][1010],ans;
long long f[30][1010];
long long t;
int main() {
    cin>>n;
    f[0][0]=1;
    for (int i=0;i<=n;i++) c[i][0]=1;
    for (int i=1;i<=n;i++) for (int j=1;j<=i;j++) c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
    for (int i=1;i<=26;i++) {
        cin>>a;
        a=min(n,a);
        for (int j=0;j<=n;j++) for (int k=j-a;k<=j;k++) f[i][j]=(f[i][j]+f[i-1][k]*c[j][k])%mod;
    }
    for (int i=1;i<=n;i++) ans=(ans+f[26][i])%mod;
    cout<<ans<<endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
const int mod=998244353;
int n,a,c[1010][1010],ans;
long long f[30][1010];
long long t;
int main() {
    cin>>n;
    f[0][0]=1;
    for (int i=0;i<=n;i++) c[i][0]=1;
    for (int i=1;i<=n;i++) for (int j=1;j<=i;j++) c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
    for (int i=1;i<=26;i++) {
        cin>>a;
        a=min(n,a);
        for (int j=0;j<=n;j++) for (int k=j-a;k<=j;k++) f[i][j]=(f[i][j]+f[i-1][k]*c[j][k])%mod;
    }
    for (int i=1;i<=n;i++) ans=(ans+f[26][i])%mod;
    cout<<ans<<endl;
}

Submission Info

Judge Result