提出 #71143514

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define lb(x) (x&-x)
#define L(i,j,k) for(int i=(j);i<=(k);++i)
#define R(i,j,k) for(int i=(j);i>=(k);--i)

namespace luoyh {
using namespace std;
using i64 = long long;

typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
void chmin(int &x, int c) { x = min(x, c); }
void chmax(int &x, int c) { x = max(x, c); }

const int maxn = 1e6 + 10, mod = 998244353;
int Add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
int Del(int a, int b) { return a - b < 0 ? a - b + mod : a - b; }
int Mul(int a, int b) { return 1ll * a * b % mod; }
void Addc(int &a, int b) { a = Add(a, b); }
void Delc(int &a, int b) { a = Del(a, b); }
void Mulc(int &a, int b) { a = Mul(a, b); }

int qmi (int a, int b) {
	int res = 1;
	for (; b; b >>= 1, a = 1ll * a * a % mod)
		if (b & 1) res = 1ll * res * a % mod;
	return res;
}
int inv (int x) { return qmi(x, mod - 2); }
int fac[maxn], infac[maxn];
int binom(int a, int b) {
	if (a < b) return 0;
	return 1ll * fac[a] * infac[b] % mod * infac[a - b] % mod;
}
int cnt[10];
int now[10];
 
void solve() {
  string S;
  cin >> S;
  for (auto c : S) cnt[c - '0']++;
  int res = 0;
  for (auto c : S) {
  	if (c - '0' <= 8) {
  	  int a = c - '0', b = a + 1;
  	  Addc(res, binom(now[a] + cnt[b] - now[b], now[a] + 1));
  	}
  	now[c - '0']++;
  }
  cout << res << '\n';
}

signed main() {
	fac[0] = 1; L (i, 1, maxn - 10) fac[i] = 1ll * fac[i - 1] * i % mod;
	infac[maxn - 10] = inv(fac[maxn - 10]);
	R (i, maxn - 11, 0) infac[i] = 1ll * infac[i + 1] * (i + 1) % mod;
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int T = 1;
  while (T--)solve();
  return 0;
}
} signed main() {
  return luoyh::main();
}

提出情報

ジャッジ結果