結果

問題 No.1085 桁和の桁和
ユーザー commy
提出日時 2025-02-08 17:00:49
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 37 ms / 2,000 ms
コード長 5,681 bytes
コンパイル時間 838 ms
コンパイル使用メモリ 81,148 KB
実行使用メモリ 13,508 KB
最終ジャッジ日時 2025-02-08 17:00:53
合計ジャッジ時間 2,697 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

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

#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
#include <limits>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
template<typename T> struct IsVector : std::false_type {};
template<typename T> struct IsVector<std::vector<T>> : std::true_type {};
template<typename T> ostream &dump_v(const vector<T> &vec, ostream &os = cerr, int indent = 0) {
    if constexpr (IsVector<T>::value) {
        os << string(indent, ' ') << "[\n";
        for (auto it = vec.begin(); it != vec.end(); ++it) dump_v(*it, os, indent + 2) << ",\n";
        os << string(indent, ' ') << "]";
    } else {
        os << string(indent, ' ') << "[";
        for (auto it = vec.begin(); it != vec.end(); ++it) os << (it == vec.begin() ? "" : ", ") << *it;
        os << "]";
    }
    return indent == 0 ? os << endl : os;
}
#else
#define dump(...) do{ } while(false)
#define dump_v(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
constexpr static struct PositiveInfinity { template<typename T> constexpr operator T() const { return numeric_limits<T>::max() / 2; } constexpr auto 
    operator-() const; } inf;  // NOLINT
constexpr static struct NegativeInfinity { template<typename T> constexpr operator T() const { return numeric_limits<T>::lowest() / 2; } constexpr 
    auto operator-() const; } NegativeInfinityVal;
constexpr auto PositiveInfinity::operator-() const { return NegativeInfinityVal; }
constexpr auto NegativeInfinity::operator-() const { return inf; }
// clang-format on
#include <iostream>
template<long long tmod>
class ModInt {
    using Self = ModInt<tmod>;
    long long n;
    auto constexpr inverse() const {
        return this->pow(*this, this->mod - 2);
    }
public:
    constexpr static long long mod = tmod;  // NOLINT
    constexpr ModInt() : n(0) {}
    constexpr ModInt(const long long in) {
        n = in % Self::mod;
        if (n < 0) n += Self::mod;
    }
    constexpr Self &operator+=(const Self &m) {
        n += m.n;
        if (n >= Self::mod) n -= Self::mod;
        return *this;
    }
    constexpr Self &operator-=(const Self &m) {
        n -= m.n;
        if (n < 0) n += Self::mod;
        return *this;
    }
    constexpr Self &operator*=(const Self &m) {
        n *= m.n;
        if (n >= Self::mod) n %= Self::mod;
        return *this;
    }
    constexpr Self &operator/=(const Self &m) {
        return (*this) *= m.inverse();
    }
    friend constexpr Self operator+(const Self &lhs, const Self &rhs) {
        return Self(lhs) += rhs;
    }
    friend constexpr Self operator-(const Self &lhs, const Self &rhs) {
        return Self(lhs) -= rhs;
    }
    friend constexpr Self operator*(const Self &lhs, const Self &rhs) {
        return Self(lhs) *= rhs;
    }
    friend constexpr Self operator/(const Self &lhs, const Self &rhs) {
        return Self(lhs) /= rhs;
    }
    constexpr Self operator=(const long long in) const {
        return Self(in);
    }
    friend std::ostream &operator<<(std::ostream &out, const Self &m) {
        out << m.n;
        return out;
    }
    friend std::istream &operator>>(std::istream &in, Self &m) {
        long long l;
        in >> l;
        m = Self(l);
        return in;
    }
    friend constexpr bool operator==(const Self &lhs, const Self &rhs) {
        return lhs.n == rhs.n;
    }
    friend constexpr bool operator!=(const Self &lhs, const Self &rhs) {
        return !(lhs == rhs);
    }
    static constexpr Self pow(const Self &x, long long p) {
        Self ans = 1;
        for (Self m = x; p > 0; p /= 2, m *= m) {
            if (p % 2) ans *= m;
        }
        return ans;
    }
    constexpr long long raw() const {
        return n;
    }
};
using mint = ModInt<1000000007>;  // NOLINT
constexpr mint operator""_m(unsigned long long m) {
    return mint(m);
}
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string t;
    cin >> t;
    int d;
    cin >> d;
    bool maybe_zero = true;
    for (auto c : t) {
        if (c != '0' and c != '?') {
            maybe_zero = false;
        }
    }
    if (d == 0) {
        print(maybe_zero);
    } else {
        if (d == 9) {
            d = 0;
        }
        const int n = t.size();
        auto dp = make_v(n + 1, 9, 0_m);
        dp[0][0] = 1_m;
        rep(i, 0, n) {
            rep(j, 0, 9) {
                if (t[i] == '?') {
                    rep(k, 0, 10) {
                        dp[i + 1][(j + k) % 9] += dp[i][j];
                    }
                } else {
                    int x = t[i] - '0';
                    dp[i + 1][(j + x) % 9] += dp[i][j];
                }
            }
        }
        print(dp[n][d] - (maybe_zero and d == 0));
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0