結果
問題 | No.1085 桁和の桁和 |
ユーザー |
|
提出日時 | 2020-06-19 21:41:25 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 94 ms / 2,000 ms |
コード長 | 2,943 bytes |
コンパイル時間 | 1,302 ms |
コンパイル使用メモリ | 105,124 KB |
最終ジャッジ日時 | 2025-01-11 05:59:01 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 35 |
ソースコード
#include <iostream>#include <algorithm>#include <map>#include <set>#include <queue>#include <stack>#include <numeric>#include <bitset>#include <cmath>static const int MOD = 1000000007;using ll = long long;using u32 = unsigned;using u64 = unsigned long long;using namespace std;template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;template <class T, class U>vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }template<class... Ts, class U>auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }template<u32 M = 1000000007>struct modint{u32 val;modint(): val(0){}template<typename T>modint(T t){t %= (T)M; if(t < 0) t += (T)M; val = t;}modint pow(ll k) const {modint res(1), x(val);while(k){if(k&1) res *= x;x *= x;k >>= 1;}return res;}template<typename T>modint& operator=(T t){t %= (T)M; if(t < 0) t += (T)M; val = t; return *this;}modint inv() const {return pow(M-2);}modint& operator+=(modint a){val += a.val; if(val >= M) val -= M; return *this;}modint& operator-=(modint a){if(val < a.val) val += M-a.val; else val -= a.val; return *this;}modint& operator*=(modint a){val = (u64)val*a.val%M; return *this;}modint& operator/=(modint a){return (*this) *= a.inv();}modint operator+(modint a) const {return modint(val) +=a;}modint operator-(modint a) const {return modint(val) -=a;}modint operator*(modint a) const {return modint(val) *=a;}modint operator/(modint a) const {return modint(val) /=a;}modint operator-(){return modint(M-val);}bool operator==(const modint a) const {return val == a.val;}bool operator!=(const modint a) const {return val != a.val;}bool operator<(const modint a) const {return val < a.val;}};using mint = modint<MOD>;int main() {int d;string s;cin >> s >> d;int n = s.size();auto dp = make_v(n+1, 2, 9, mint(0));dp[0][1][0] = 1;for (int i = 0; i < n; ++i) {for (int j = 0; j < 2; ++j) {for (int k = 0; k < 9; ++k) {if(s[i] == '?'){for (int l = 0; l < 10; ++l) {dp[i+1][j&(l == 0)][(k+l)%9] += dp[i][j][k];}}else {int l = (s[i]-'0')%10;dp[i+1][j&(l == 0)][(k+l)%9] += dp[i][j][k];}}}}if(d == 0){printf("%d\n", dp.back()[1][0].val);}else if(d == 9) {printf("%d\n", dp.back()[0][0].val);}else {printf("%d\n", dp.back()[0][d].val);}return 0;}