結果

問題 No.1417 100の倍数かつ正整数(2)
ユーザー tkmst201
提出日時 2021-05-23 09:31:43
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
MLE  
実行時間 -
コード長 4,369 bytes
コンパイル時間 2,528 ms
コンパイル使用メモリ 217,348 KB
最終ジャッジ日時 2025-01-21 17:35:11
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 31 MLE * 5
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//
/**
 * @brief https://tkmst201.github.io/Library/Mathematics/ModInt.hpp
 */
template<int M>
struct ModInt {
    static_assert(M > 0);
    
    using value_type = int;
    using calc_type = std::int_fast64_t;
    
private:
    value_type val_;
    
public:
    constexpr ModInt(calc_type val = 0) : val_(val < 0 ? (val % M + M) % M : val % M) {}
    constexpr value_type val() const noexcept { return val_; }
    constexpr static decltype(M) mod() noexcept { return M; }
    
    explicit constexpr operator bool() const noexcept { return val_; }
    constexpr bool operator !() const noexcept { return !static_cast<bool>(*this); }
    constexpr ModInt operator +() const noexcept { return *this; }
    constexpr ModInt operator -() const noexcept { return ModInt(-val_); }
    constexpr ModInt operator ++(int) noexcept { ModInt res = *this; ++*this; return res; }
    constexpr ModInt operator --(int) noexcept { ModInt res = *this; --*this; return res; }
    constexpr ModInt & operator ++() noexcept { val_ = val_ + 1 == M ? 0 : val_ + 1; return *this; }
    constexpr ModInt & operator --() noexcept { val_ = val_ == 0 ? M - 1 : val_ - 1; return *this; }
    constexpr ModInt & operator +=(const ModInt & rhs) noexcept { val_ += val_ < M - rhs.val_ ? rhs.val_ : rhs.val_ - M; return *this; }
    constexpr ModInt & operator -=(const ModInt & rhs) noexcept { val_ += val_ >= rhs.val_ ? -rhs.val_ : M - rhs.val_; return *this; }
    constexpr ModInt & operator *=(const ModInt & rhs) noexcept { val_ = static_cast<calc_type>(val_) * rhs.val_ % M; return *this; }
    constexpr ModInt & operator /=(const ModInt & rhs) noexcept { return *this *= rhs.inv(); }
    friend constexpr ModInt operator +(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) += rhs; }
    friend constexpr ModInt operator -(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) -= rhs; }
    friend constexpr ModInt operator *(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) *= rhs; }
    friend constexpr ModInt operator /(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) /= rhs; }
    friend constexpr bool operator ==(const ModInt & lhs, const ModInt & rhs) noexcept { return lhs.val_ == rhs.val_; }
    friend constexpr bool operator !=(const ModInt & lhs, const ModInt & rhs) noexcept { return !(lhs == rhs); }
    friend std::ostream & operator <<(std::ostream & os, const ModInt & rhs) { return os << rhs.val_; }
    friend std::istream & operator >>(std::istream & is, ModInt & rhs) { calc_type x; is >> x; rhs = ModInt(x); return is; }
    
    constexpr ModInt pow(calc_type n) const noexcept {
        ModInt res = 1, x = val_;
        if (n < 0) { x = x.inv(); n = -n; }
        while (n) { if (n & 1) res *= x; x *= x; n >>= 1; }
        return res;
    }
    
    constexpr ModInt inv() const noexcept {
        value_type a = val_, a1 = 1, b = M, b1 = 0;
        while (b > 0) {
            value_type q = a / b, r = a % b;
            value_type nb1 = a1 - q * b1;
            a = b; b = r;
            a1 = b1; b1 = nb1;
        }
        assert(a == 1);
        return a1;
    }
};
using mint = ModInt<MOD>;
int main() {
    string S;
    cin >> S;
    const int N = S.size();
    
    // [i][mod100][zero][leadingzero][ismax]
    vector dp(N + 1, vector(100, vector(2, vector(2, vector<mint>(2)))));
    vector done(N + 1, vector(100, vector(2, vector(2, vector<bool>(2)))));
    
    dp[N][0][false][false][true] = 1;
    dp[N][0][false][false][false] = 1;
    for (int i = N - 1; i >= 0; --i) {
        REP(m, 100) {
            REP(zero, 2) {
                REP(lzero, 2) {
                    REP(ism, 2) {
                        const int ma = ism ? S[i] - '0' : 9;
                        REP(k, ma + 1) {
                            mint & cur = dp[i][m][zero][lzero][ism];
                            if (lzero) cur += dp[i + 1][k][k == 0][k == 0][ism & (k == ma)];
                            else cur += dp[i + 1][(m * k) % 100][(k == 0) | zero][lzero][ism & (k == ma)];
                        }
                    }
                }
            }
        }
    }
    
    cout << dp[0][0][true][true][true] << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0