結果

問題 No.1085 桁和の桁和
ユーザー stoqstoq
提出日時 2020-06-20 08:30:53
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,948 bytes
コンパイル時間 2,191 ms
コンパイル使用メモリ 203,820 KB
実行使用メモリ 10,752 KB
最終ジャッジ日時 2024-07-23 00:44:38
合計ジャッジ時間 3,730 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
10,360 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 5 ms
10,444 KB
testcase_03 AC 4 ms
10,356 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 5 ms
10,368 KB
testcase_08 AC 4 ms
10,496 KB
testcase_09 WA -
testcase_10 AC 2 ms
5,376 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 6 ms
10,368 KB
testcase_14 AC 8 ms
10,516 KB
testcase_15 AC 14 ms
10,604 KB
testcase_16 AC 14 ms
10,752 KB
testcase_17 AC 9 ms
10,624 KB
testcase_18 AC 6 ms
10,468 KB
testcase_19 AC 12 ms
10,712 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 8 ms
10,624 KB
testcase_22 AC 12 ms
10,640 KB
testcase_23 AC 5 ms
10,472 KB
testcase_24 AC 5 ms
10,368 KB
testcase_25 AC 10 ms
10,496 KB
testcase_26 AC 13 ms
10,556 KB
testcase_27 AC 12 ms
10,752 KB
testcase_28 AC 15 ms
10,688 KB
testcase_29 AC 10 ms
10,496 KB
testcase_30 AC 10 ms
10,616 KB
testcase_31 AC 14 ms
10,596 KB
testcase_32 AC 10 ms
10,448 KB
testcase_33 AC 20 ms
10,624 KB
testcase_34 AC 20 ms
10,624 KB
testcase_35 AC 22 ms
10,616 KB
testcase_36 AC 22 ms
10,728 KB
testcase_37 AC 22 ms
10,736 KB
testcase_38 AC 21 ms
10,624 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 1

#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using multiInt = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
*/
/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
*/
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
//constexpr ll MOD = 1;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-10;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

inline void init_main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);
}
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

#pragma region mint
template <int MOD>
struct Fp
{
  long long val;

  constexpr Fp(long long v = 0) noexcept : val(v % MOD)
  {
    if (val < 0)
      v += MOD;
  }

  constexpr int getmod()
  {
    return MOD;
  }

  constexpr Fp operator-() const noexcept
  {
    return val ? MOD - val : 0;
  }

  constexpr Fp operator+(const Fp &r) const noexcept
  {
    return Fp(*this) += r;
  }

  constexpr Fp operator-(const Fp &r) const noexcept
  {
    return Fp(*this) -= r;
  }

  constexpr Fp operator*(const Fp &r) const noexcept
  {
    return Fp(*this) *= r;
  }

  constexpr Fp operator/(const Fp &r) const noexcept
  {
    return Fp(*this) /= r;
  }

  constexpr Fp &operator+=(const Fp &r) noexcept
  {
    val += r.val;
    if (val >= MOD)
      val -= MOD;
    return *this;
  }

  constexpr Fp &operator-=(const Fp &r) noexcept
  {
    val -= r.val;
    if (val < 0)
      val += MOD;
    return *this;
  }

  constexpr Fp &operator*=(const Fp &r) noexcept
  {
    val = val * r.val % MOD;
    if (val < 0)
      val += MOD;
    return *this;
  }

  constexpr Fp &operator/=(const Fp &r) noexcept
  {
    long long a = r.val, b = MOD, u = 1, v = 0;
    while (b)
    {
      long long t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    val = val * u % MOD;
    if (val < 0)
      val += MOD;
    return *this;
  }

  constexpr bool operator==(const Fp &r) const noexcept
  {
    return this->val == r.val;
  }

  constexpr bool operator!=(const Fp &r) const noexcept
  {
    return this->val != r.val;
  }

  friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept
  {
    return os << x.val;
  }

  friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept
  {
    return is >> x.val;
  }
};

Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept
{
  if (n == 0)
    return 1;
  auto t = modpow(a, n / 2);
  t = t * t;
  if (n & 1)
    t = t * a;
  return t;
}

using mint = Fp<MOD>;
#pragma endregion

void solve()
{
  string s;
  int d;
  cin >> s >> d;
  int n = s.length();
  if (d == 0)
  {
    for (auto c : s)
    {
      if (c != '0' and c != '?')
      {
        cout << 0 << "\n";
        return;
      }
    }
    cout << 1 << "\n";
    return;
  }

  mint dp[100010][9] = {};
  dp[0][0] = 1;
  rep(i, n) rep(j, 9)
  {
    if (s[i] == '?')
    {
      rep(k, 10)
      {
        dp[i + 1][(j + k) % 9] += dp[i][j];
      }
    }
    else
    {
      int a = s[i] - '0';
      dp[i + 1][(j + a) % 9] += dp[i][j];
    }
  }
  cout << (d == 9 ? dp[n][0] : dp[n][d]) << "\n";
}

int main()
{
  init_main();

  solve();

  return 0;
}
0