提出 #39058686

---

ソースコード 拡げる

#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 = 6e7 + 5;
int n, x, y, z, ans;
int fac[N], facinv[N];
void preprocess()
{
    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);
}
int binom(int n, int m)
{
    if(n < m) return 0;
    return mul(fac[n], mul(facinv[m], facinv[n - m]));
}
int main()
{
    preprocess();
    scanf("%d %d %d %d", &n, &x, &y, &z);
    if(x < 0) x = -x;
    if(y < 0) y = -y;
    if(z < 0) z = -z;
    if((n & 1) ^ ((x + y + z) & 1))
    {
        puts("0");
        return 0;
    }
    if(n < x + y + z)
    {
        puts("0");
        return 0;
    }
    int w = (n - x - y - z) / 2;
    for(int S = 0; S <= w; ++S)
    {
        int v = mul(fac[n], mul(facinv[S], mul(facinv[x + y + S], facinv[n - x - y - 2 * S])));
        Mul(v, binom(x + y + 2 * S, y + S)); Mul(v, binom(z + 2 * w - 2 * S, w - S));
        Inc(ans, v);
    }
    printf("%d\n", ans);
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:56:10: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   56 |     scanf("%d %d %d %d", &n, &x, &y, &z);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

ジャッジ結果