Submission #72406957

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;

int main () {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int n, m, x;
  cin >> n >> m >> x;
  mint ans = 0;
  for (int y = 0; y <= m; y++) {
    int a = y, b = x;
    int remaining = n-2;

    while (remaining > 0) {
      if (a > 0 && b/a >= 2 && remaining >= 3) {
        int batches = min(b/a/2, remaining/3);
        b -= 2*a*batches;
        remaining -= 3*batches;
        continue;
      }
      if (min(a, b) == 0 && remaining >= 3) {
        remaining %= 3;
        continue;
      }
      tie(a, b) = make_pair(abs(a-b), a);
      remaining--;
    }
    ans += mint(a) * mint(b);
  }
  cout << ans.val() << '\n';
}

Submission Info

Judge Result