結果
問題 |
No.1407 Kindness
|
ユーザー |
![]() |
提出日時 | 2021-02-26 21:33:24 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 38 ms / 2,000 ms |
コード長 | 4,021 bytes |
コンパイル時間 | 2,146 ms |
コンパイル使用メモリ | 200,484 KB |
最終ジャッジ日時 | 2025-01-19 04:53:12 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
// Template #include <bits/stdc++.h> #define rep_override(x, y, z, name, ...) name #define rep2(i, n) for (int i = 0; i < (int)(n); ++i) #define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i) #define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() using namespace std; using ll = long long; constexpr int inf = 1001001001; constexpr ll infll = 3003003003003003003LL; template <typename T> inline bool chmin(T &x, const T &y) { if (x > y) { x = y; return true; } return false; } template <typename T> inline bool chmax(T &x, const T &y) { if (x < y) { x = y; return true; } return false; } template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (T &element : vec) is >> element; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { for (int i = 0, vec_len = (int)vec.size(); i < vec_len; ++i) { os << vec[i] << (i + 1 == vec_len ? "" : " "); } return os; } struct IOSET { IOSET() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); } } ioset; // Mod-Int #include <iostream> #include <type_traits> template <unsigned int mod, std::enable_if_t<mod >= 1u && mod < (1u << 31)> * = nullptr> struct ModInt { unsigned int val; ModInt() : val(0) {} ModInt(long long x) : val(x < 0 ? x % mod + mod : (unsigned long long)x % mod) {} ModInt<mod> &operator+=(const ModInt<mod> &x) { val += x.val; if (val >= mod) val -= mod; return *this; } ModInt<mod> &operator-=(const ModInt<mod> &x) { if (val < x.val) val += mod; val -= x.val; return *this; } ModInt<mod> &operator*=(const ModInt<mod> &x) { unsigned long long s = (unsigned long long)val * x.val; val = (unsigned int)(s % mod); return *this; } ModInt<mod> operator+() const { return *this; } ModInt<mod> operator-() const { return ModInt<mod>(0u) - *this; } friend ModInt<mod> operator+(const ModInt<mod> &x, const ModInt<mod> &y) { return ModInt<mod>(x) += y; } friend ModInt<mod> operator-(const ModInt<mod> &x, const ModInt<mod> &y) { return ModInt<mod>(x) -= y; } friend ModInt<mod> operator*(const ModInt<mod> &x, const ModInt<mod> &y) { return ModInt<mod>(x) *= y; } friend std::istream &operator>>(std::istream &is, ModInt<mod> &x) { is >> x.val; // x.value %= mod; return is; } friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &x) { os << x.val; return os; } ModInt<mod> pow(unsigned long long x) const { ModInt<mod> res(1), s(*this); while (x) { if (x & 1) res *= s; s *= s; x >>= 1; } return res; } // --- mod is prime --- ModInt<mod> &operator/=(const ModInt<mod> &x) { *this *= x.pow(mod - 2); return *this; } friend ModInt<mod> operator/(const ModInt<mod> &x, const ModInt<mod> &y) { return ModInt<mod>(x) /= y; } }; // Main int main() { string n; cin >> n; int sz = n.size(); using Mint = ModInt<1000000007>; vector<vector<vector<Mint>>> dp(sz + 1, vector<vector<Mint>>(2, vector<Mint>(2, Mint(0)))); dp[0][0][0] = Mint(1); rep(i, sz) rep(j, 2) rep(k, 2) { for (int d = 0; d <= (j ? 9 : n[i] - '0'); ++d) { if (k) { dp[i + 1][j || d < n[i] - '0'][k] += dp[i][j][k] * Mint(d); } else { if (d) dp[i + 1][j || d < n[i] - '0'][1] += dp[i][j][k] * Mint(d); else dp[i + 1][j || d < n[i] - '0'][0] += dp[i][j][k]; } } } Mint ans(-1); rep(i, 2) rep(j, 2) ans += dp[sz][i][j]; cout << ans << "\n"; }