提出 #29892752

---

ソースコード 拡げる

#include<cstdio>
#include<algorithm>
using namespace std;
using ll = long long;
constexpr const ll mod = 998244353;
inline ll Inv(ll val)
{
	ll ans = 1;
	for (; val > 1; ans = ans * (mod - mod / val) % mod, val = mod % val);
	return ans;
}
ll fac[10001], inv_fac[10001];//, f[55][55][2552];
inline ll C(const ll a, const ll b)
{
	return a >= 0 && b >= 0 && a >= b ? fac[a] * inv_fac[b] % mod * inv_fac[a - b] % mod : 0;
}
int main()
{
	fac[0] = 1;
	for (ll i = 1; i <= 10000; fac[i] = fac[i - 1] * i % mod, ++i);
	inv_fac[10000] = Inv(fac[10000]);
	for (ll i = 10000; i; inv_fac[i - 1] = inv_fac[i] * i % mod, --i);
	ll n, m, b, w;
	scanf("%lld%lld%lld%lld", &n, &m, &b, &w);
	//for (ll i = 1; i <= n; ++i)
	//{
	//	f[i][1][i] = 1;
	//	for (ll j = 1;;)
	//	{
	//	}
	//}
	ll ans = 0;
	for (ll i = 1; i < n; ++i)
	{
		for (ll j = 1; j < m; ++j)
		{
			for (ll k = 1; k <= n - i; ++k)
			{
				for (ll u = 1; u <= m - j; ++u)
				{
					ans += ((n + m - i - j - k - u) % 2 ? mod - 1 : 1) * C(n, i) % mod * C(m, j) % mod * C(n - i, k) % mod * C(m - j, u) % mod * C(i * j, b) % mod * C(k * u, w);
					ans %= mod;
				}
			}
		}
	}
	printf("%lld", ans);
	return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   24 |  scanf("%lld%lld%lld%lld", &n, &m, &b, &w);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

ジャッジ結果