結果

問題 No.1085 桁和の桁和
ユーザー tokusakurai
提出日時 2020-06-19 22:34:42
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 33 ms / 2,000 ms
コード長 3,513 bytes
コンパイル時間 1,782 ms
コンパイル使用メモリ 168,760 KB
実行使用メモリ 10,624 KB
最終ジャッジ日時 2024-11-06 17:38:47
合計ジャッジ時間 3,149 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
template<ll mod> struct Mod_Int{
    ll x;
    Mod_Int() {}
    Mod_Int(ll y) : x (y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    Mod_Int &operator += (const Mod_Int &p) {
        x = (x + p.x) % mod;
        return *this;
    }
    Mod_Int &operator -= (const Mod_Int &p) {
        x = (x + mod - p.x) % mod;
        return *this;
    }
    Mod_Int &operator *= (const Mod_Int &p) {
        x = (x * p.x) % mod;
        return *this;
    }
    Mod_Int &operator /= (const Mod_Int &p) {
        *this *= p.inverse();
        return *this;
    }
    Mod_Int &operator ++ () {return *this += (Mod_Int)1;}
    Mod_Int operator ++ (int) {
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }
    Mod_Int &operator -- () {return *this -= (Mod_Int)1;}
    Mod_Int operator -- (int) {
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }
    Mod_Int operator - () const {return Mod_Int(-x);}
    Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}
    Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}
    Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}
    Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}
    bool operator == (const Mod_Int &p) const {return x == p.x;}
    bool operator != (const Mod_Int &p) const {return x != p.x;}
    Mod_Int pow (ll n) const {
        Mod_Int now = *this, ret = 1;
        while(n > 0){
            if(n & 1) ret *= now;
            now *= now, n >>= 1;
        }
        return ret;
    }
    Mod_Int inverse () const {
        return pow(mod-2);
    }
};
using mint = Mod_Int<MOD>;
const int MAX_N = 1e6;
mint fac[MAX_N+1], ifac[MAX_N+1];
void init(){
    fac[0] = 1;
    rep2(i, 1, MAX_N){
        fac[i] = fac[i-1]*i;
    }
    ifac[MAX_N] = fac[MAX_N].inverse();
    rep3(i, MAX_N, 1){
        ifac[i-1] = ifac[i]*i;
    }
}
mint comb(int n, int k){
    return fac[n]*ifac[n-k]*ifac[k];
}
mint perm(int n, int k){
    return fac[n]*ifac[n-k];
}
int main(){
    string S;
    int D;
    cin >> S >> D;
    int N = sz(S), n = 0, sum = 0;
    if(D == 0){
        rep(i, N){
            if(S[i] != '0' && S[i] != '?') {cout << 0 << endl; return 0;}
        }
        cout << 1 << endl; return 0;
    }
    rep(i, N){
        if(S[i] == '?') n++;
        else sum += S[i]-'0';
    }
    D = (sum+9-D)%9;
    mint dp[n+1][9];
    fill(dp[0], dp[n+1], 0);
    dp[0][0] = 1;
    rep(i, n){
        rep(j, 9){
            rep(k, 10){
                dp[i+1][(j+k)%9] += dp[i][j];
            }
        }
    }
    mint ans = dp[n][D];
    if(sum == 0 && D == 0) ans--;
    cout << ans.x << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0