結果
問題 | No.1085 桁和の桁和 |
ユーザー | はまやんはまやん |
提出日時 | 2020-06-20 15:09:39 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 25 ms / 2,000 ms |
コード長 | 3,723 bytes |
コンパイル時間 | 2,151 ms |
コンパイル使用メモリ | 195,416 KB |
最終ジャッジ日時 | 2025-01-11 08:40:38 |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
7,112 KB |
testcase_01 | AC | 3 ms
7,128 KB |
testcase_02 | AC | 5 ms
7,168 KB |
testcase_03 | AC | 5 ms
7,168 KB |
testcase_04 | AC | 5 ms
7,432 KB |
testcase_05 | AC | 4 ms
7,260 KB |
testcase_06 | AC | 3 ms
7,212 KB |
testcase_07 | AC | 4 ms
7,104 KB |
testcase_08 | AC | 4 ms
7,136 KB |
testcase_09 | AC | 4 ms
7,340 KB |
testcase_10 | AC | 4 ms
7,176 KB |
testcase_11 | AC | 3 ms
7,200 KB |
testcase_12 | AC | 3 ms
7,324 KB |
testcase_13 | AC | 5 ms
7,168 KB |
testcase_14 | AC | 9 ms
7,316 KB |
testcase_15 | AC | 14 ms
7,412 KB |
testcase_16 | AC | 15 ms
7,552 KB |
testcase_17 | AC | 9 ms
7,452 KB |
testcase_18 | AC | 7 ms
7,168 KB |
testcase_19 | AC | 13 ms
7,328 KB |
testcase_20 | AC | 4 ms
7,372 KB |
testcase_21 | AC | 10 ms
7,420 KB |
testcase_22 | AC | 13 ms
7,492 KB |
testcase_23 | AC | 4 ms
7,304 KB |
testcase_24 | AC | 4 ms
7,296 KB |
testcase_25 | AC | 11 ms
7,164 KB |
testcase_26 | AC | 16 ms
7,488 KB |
testcase_27 | AC | 13 ms
7,416 KB |
testcase_28 | AC | 16 ms
7,356 KB |
testcase_29 | AC | 10 ms
7,284 KB |
testcase_30 | AC | 11 ms
7,292 KB |
testcase_31 | AC | 16 ms
7,296 KB |
testcase_32 | AC | 11 ms
7,268 KB |
testcase_33 | AC | 24 ms
7,448 KB |
testcase_34 | AC | 23 ms
7,380 KB |
testcase_35 | AC | 24 ms
7,452 KB |
testcase_36 | AC | 25 ms
7,424 KB |
testcase_37 | AC | 24 ms
7,352 KB |
testcase_38 | AC | 24 ms
7,444 KB |
ソースコード
#include<bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<b;i++)#define rrep(i,a,b) for(int i=a;i>=b;i--)#define fore(i,a) for(auto &i:a)#define all(x) (x).begin(),(x).end()//#pragma GCC optimize ("-O3")using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }//---------------------------------------------------------------------------------------------------template<int MOD> struct ModInt {static const int Mod = MOD; unsigned x; ModInt() : x(0) { }ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }int get() const { return (int)x; }ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }ModInt operator+(ModInt that) const { return ModInt(*this) += that; }ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }return ModInt(u); }bool operator==(ModInt that) const { return x == that.x; }bool operator!=(ModInt that) const { return x != that.x; }ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }};template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }typedef ModInt<1000000007> mint;/*---------------------------------------------------------------------------------------------------∧_∧∧_∧ (´<_` ) Welcome to My Coding Space!( ´_ゝ`) / ⌒i @hamayanhamayan0/ \ | |/ / ̄ ̄ ̄ ̄/ |__(__ニつ/ _/ .| .|____\/____/ (u ⊃---------------------------------------------------------------------------------------------------*/string T; int D;mint dp[101010][9];//---------------------------------------------------------------------------------------------------void _main() {cin >> T >> D;bool canAllZero = true;fore(x, T) if (x != '?' && x != '0') canAllZero = false;if (D == 0) {if (canAllZero) cout << 1 << endl;else cout << 0 << endl;return;}int N = T.size();dp[0][0] = 1;rep(i, 0, N) rep(mo, 0, 9) {if (T[i] == '?') {rep(nxt, 0, 10) dp[i + 1][(mo + nxt) % 9] += dp[i][mo];}else {dp[i + 1][(mo + T[i] - '0') % 9] += dp[i][mo];}}D %= 9;if (D == 0 && canAllZero) dp[N][D] -= 1;cout << dp[N][D] << endl;}