提出 #43483669

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define LL long long
#define DB double
#define MOD 998244353
#define ls(x) x << 1
#define rs(x) x << 1 | 1
#define lowbit(x) x & (-x)
#define PII pair<int, int>
#define MP make_pair
#define VI vector<int>
#define VII vector<int>::iterator
#define EB emplace_back
#define SI set<int>
#define SII set<int>::iterator
#define QI queue<int>
using namespace std;
template<typename T> void chkmn(T &a, const T &b) { (a > b) && (a = b); }
template<typename T> void chkmx(T &a, const T &b) { (a < b) && (a = b); }
int inc(const int &a, const int &b) { return a + b >= MOD ? a + b - MOD : a + b; }
int dec(const int &a, const int &b) { return a - b < 0 ? a - b + MOD : a - b; }
int mul(const int &a, const int &b) { return 1LL * a * b % MOD; }
void Inc(int &a, const int &b) { ((a += b) >= MOD) && (a -= MOD); }
void Dec(int &a, const int &b) { ((a -= b) < 0) && (a += MOD); }
void Mul(int &a, const int &b) { a = 1LL * a * b % MOD; }
void Sqr(int &a) { a = 1LL * a * a % MOD; }
int qwqmi(int x, int k = MOD - 2)
{
	int res = 1;
	while(k)
	{
		if(k & 1) Mul(res, x);
		Sqr(x), k >>= 1;
	}
	return res;
}
const int N = 505;
int C[N][N], fac[N], facinv[N], qwq[N][N];
void preprocess()
{
	C[0][0] = 1;
	for(int i = 1; i < N; ++i)
		for(int j = 0; j < N; ++j)
		{
			if(!j) C[i][j] = 1;
			else C[i][j] = inc(C[i - 1][j], C[i - 1][j - 1]);
		}
	fac[0] = facinv[0] = 1;
	for(int i = 1; i < N; ++i)
		fac[i] = mul(fac[i - 1], i);
	facinv[N - 1] = qwqmi(fac[N - 1]);
	for(int i = N - 2; i >= 1; --i)
		facinv[i] = mul(facinv[i + 1], i + 1);
	for(int i = 0; i < N; ++i)
	{
		qwq[i][0] = 1;
		for(int j = 1; j < N; ++j)
			qwq[i][j] = mul(qwq[i][j - 1], facinv[i]);
	}
}
int n, a[N], s[N];
int f[N][N][N], ans;
int main()
{
	preprocess();
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i)
	{
		scanf("%d", &a[i]);
		s[a[i]]++;
	}
	for(int i = n; i >= 0; --i)
		s[i] += s[i + 1];
	f[n + 1][0][0] = 1;
	for(int i = n; i >= 0; --i)
	{
		for(int j = 0; (i + 1) * j <= s[i + 1]; ++j)
		{
			for(int k = 0; k <= s[i + 1]; ++k)
			{
				for(int x = 0; x + j <= s[i] && k + i * x <= s[i]; ++x)
				{
					int w = f[i + 1][j][k];
					Mul(w, C[s[i] - j][x]);
					Mul(w, fac[s[i] - k]);
					Mul(w, qwq[i][x]);
					Mul(w, facinv[s[i] - k - i * x]);
					Inc(f[i][j + x][k + i * x], w);
				}
			}
		}
	}
	printf("%d\n", f[0][n][n]);
	return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:65:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   65 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
./Main.cpp:68:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   68 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~

ジャッジ結果