提出 #42741334

---

ソースコード 拡げる

#include<bits/stdc++.h>
using namespace std;
const int MAXN=505,mod=998244353;
typedef long long ll;
ll fac[MAXN],ifac[MAXN],inv[MAXN],f[MAXN][MAXN][MAXN],ans;
int n,a[MAXN],b[MAXN];
inline ll C(int n,int m) {
	return n<m?0ll:fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
int main() {
	fac[0]=ifac[0]=fac[1]=ifac[1]=inv[1]=1;
	for(int i=2; i<MAXN; ++i) {
		fac[i]=fac[i-1]*i%mod;
		inv[i]=inv[mod%i]*(mod-mod/i)%mod;
		ifac[i]=ifac[i-1]*inv[i]%mod;
	}
	scanf("%d",&n);
	for(int i=1; i<=n; ++i) scanf("%d",&a[i]),++b[a[i]];
	for(int i=n-1; i; --i) b[i]+=b[i+1];
	f[n][0][0]=1;
	for(int i=n; i; --i)
		for(int j=0; j<=n; ++j)
			for(int k=0; k<=b[i]; ++k)
				if(f[i][j][k])
					for(int l=0,tmp1=b[i]-k,tmp2=fac[tmp1]; l*i+k<=b[i]; ++l,tmp1-=i,tmp2=tmp2*ifac[i]%mod)
						f[i-1][j+l][l*i+k]=(f[i-1][j+l][l*i+k]+C(b[i]-j,l)*tmp2%mod*ifac[tmp1]%mod*f[i][j][k])%mod;
	for(int i=1; i<=n; ++i) ans=(ans+f[0][i][n])%mod;
	printf("%lld\n",ans);
	return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   17 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
./Main.cpp:18:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   18 |  for(int i=1; i<=n; ++i) scanf("%d",&a[i]),++b[a[i]];
      |                          ~~~~~^~~~~~~~~~~~

ジャッジ結果