結果

問題 No.1085 桁和の桁和
ユーザー rniyarniya
提出日時 2020-06-19 22:01:49
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 41 ms / 2,000 ms
コード長 6,409 bytes
コンパイル時間 1,748 ms
コンパイル使用メモリ 172,916 KB
実行使用メモリ 25,088 KB
最終ジャッジ日時 2024-11-06 17:34:20
合計ジャッジ時間 3,776 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
14,848 KB
testcase_01 AC 10 ms
14,848 KB
testcase_02 AC 11 ms
14,976 KB
testcase_03 AC 11 ms
14,848 KB
testcase_04 AC 11 ms
15,232 KB
testcase_05 AC 11 ms
14,848 KB
testcase_06 AC 10 ms
14,848 KB
testcase_07 AC 11 ms
14,976 KB
testcase_08 AC 11 ms
14,976 KB
testcase_09 AC 10 ms
14,976 KB
testcase_10 AC 11 ms
14,976 KB
testcase_11 AC 10 ms
14,976 KB
testcase_12 AC 11 ms
14,848 KB
testcase_13 AC 13 ms
16,000 KB
testcase_14 AC 19 ms
18,560 KB
testcase_15 AC 31 ms
23,552 KB
testcase_16 AC 32 ms
23,552 KB
testcase_17 AC 21 ms
18,816 KB
testcase_18 AC 16 ms
16,896 KB
testcase_19 AC 29 ms
22,656 KB
testcase_20 AC 11 ms
15,104 KB
testcase_21 AC 23 ms
19,840 KB
testcase_22 AC 28 ms
21,888 KB
testcase_23 AC 12 ms
15,488 KB
testcase_24 AC 11 ms
15,104 KB
testcase_25 AC 22 ms
19,200 KB
testcase_26 AC 33 ms
23,808 KB
testcase_27 AC 28 ms
22,144 KB
testcase_28 AC 35 ms
25,088 KB
testcase_29 AC 24 ms
20,352 KB
testcase_30 AC 22 ms
19,712 KB
testcase_31 AC 31 ms
23,424 KB
testcase_32 AC 25 ms
20,864 KB
testcase_33 AC 41 ms
25,088 KB
testcase_34 AC 41 ms
25,088 KB
testcase_35 AC 40 ms
25,088 KB
testcase_36 AC 40 ms
25,088 KB
testcase_37 AC 40 ms
25,088 KB
testcase_38 AC 40 ms
25,088 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(x) (x).begin(),(x).end()
const long long MOD=1e9+7;
// const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};
#define LOCAL

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    cout << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();++itr){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();++itr){
        os << *itr;
        if (++itr!=s.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

template<uint_fast64_t Modulus> class modint{
    using u64=uint_fast64_t;
    public:
    u64 a;
    constexpr modint(const u64 x=0) noexcept:a(((x%Modulus)+Modulus)%Modulus){}
    constexpr u64 &value() noexcept{return a;}
    constexpr const u64 &value() const noexcept{return a;}
    constexpr modint &operator+=(const modint &rhs) noexcept{
        a+=rhs.a;
        if (a>=Modulus) a-=Modulus;
        return *this;
    }
    constexpr modint operator+(const modint &rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint &operator++() noexcept{
        return ++a,*this;
    }
    constexpr modint operator++(int) noexcept{
        modint t=*this; return ++a,t;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept{
        if (a<rhs.a) a+=Modulus;
        a-=rhs.a;
        return *this;
    }
    constexpr modint operator-(const modint &rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint &operator--() noexcept{
        return --a,*this;
    }
    constexpr modint operator--(int) noexcept{
        modint t=*this; return --a,t;
    }
    constexpr modint &operator*=(const modint &rhs) noexcept{
        a=a*rhs.a%Modulus;
        return *this;
    }
    constexpr modint operator*(const modint &rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        u64 exp=Modulus-2;
        while(exp){
            if (exp&1) *this*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return *this;
    }
    constexpr modint operator/(const modint &rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint operator-() const noexcept{
        return modint(Modulus-a);
    }
    constexpr bool operator==(const modint &rhs) const noexcept{
        return a==rhs.a;
    }
    constexpr bool operator!=(const modint &rhs) const noexcept{
        return a!=rhs.a;
    }
    constexpr bool operator!() const noexcept{return !a;}
    friend constexpr modint pow(modint rhs,long long exp) noexcept{
        modint res{1};
        while(exp){
            if (exp&1) res*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return res;
    }
    template<class T> friend constexpr modint operator+(T x,modint y) noexcept{
        return modint(x)+y;
    }
    template<class T> friend constexpr modint operator-(T x,modint y) noexcept{
        return modint(x)-y;
    }
    template<class T> friend constexpr modint operator*(T x,modint y) noexcept{
        return modint(x)*y;
    }
    template<class T> friend constexpr modint operator/(T x,modint y) noexcept{
        return modint(x)/y;
    }
    friend ostream &operator<<(ostream &s,const modint &rhs) noexcept{
        return s << rhs.a;
    }
    friend istream &operator>>(istream &s,modint &rhs) noexcept{
        u64 a; rhs=modint{(s >> a,a)}; return s;
    }
};

using mint=modint<MOD>;

const int MAX=5e5+10;
vector<mint> fac(MAX),finv(MAX),inv(MAX);
void COMinit(){
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    for (int i=2;i<MAX;++i){
        fac[i]=fac[i-1]*i;
        inv[i]=-inv[MOD%i]*(MOD/i);
        finv[i]=finv[i-1]*inv[i];
    }
}
mint COM(int n,int k){
    if (n<k||n<0||k<0) return 0;
    return fac[n]*finv[k]*finv[n-k];
}

// Be careful with the value of MAX and conducting COMinit()

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    string S; cin >> S;
    int n=S.size();
    int D; cin >> D;
    if (D==0){
        for (int i=0;i<n;++i){
            if (S[i]!='0'&&S[i]!='?'){
                cout << 0 << '\n';
                return 0;
            }
        }
        cout << 1 << '\n';
        return 0;
    }
    D%=9;
    vector<vector<mint>> dp(n+1,vector<mint>(9,0));
    dp[0][0]=1;
    for (int i=0;i<n;++i){
        if (S[i]=='?'){
            for (int j=0;j<9;++j){
                for (int k=0;k<=9;++k){
                    dp[i+1][(j+k)%9]+=dp[i][j];
                }
            }
        } else {
            int add=S[i]-'0';
            for (int j=0;j<9;++j){
                dp[i+1][(j+add)%9]+=dp[i][j];
            }
        }
    }
    int all=1;
    for (int i=0;i<n;++i) if (S[i]!='0'&&S[i]!='?') all=0;
    cout << dp[n][D]-(D==0?all:0) << '\n';
}
0