結果
問題 | No.1417 100の倍数かつ正整数(2) |
ユーザー |
|
提出日時 | 2021-03-06 01:55:47 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 32 ms / 3,000 ms |
コード長 | 4,481 bytes |
コンパイル時間 | 1,988 ms |
コンパイル使用メモリ | 193,612 KB |
最終ジャッジ日時 | 2025-01-19 12:14:48 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#line 1 "/home/siro53/kyo-pro/compro_library/template/template.cpp"#include <bits/stdc++.h>using namespace std;template <class T> inline bool chmax(T &a, T b) {if(a < b) {a = b;return 1;}return 0;}template <class T> inline bool chmin(T &a, T b) {if(a > b) {a = b;return 1;}return 0;}#define DEBUG#ifdef DEBUGtemplate <class T, class U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {os << '{';for(int i = 0; i < (int)v.size(); i++) {if(i) { os << ','; }os << v[i];}os << '}';return os;}void debugg() { cerr << endl; }template <class T, class... Args>void debugg(const T &x, const Args &... args) {cerr << " " << x;debugg(args...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifstruct Setup {Setup() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}} __Setup;using ll = long long;#define ALL(v) (v).begin(), (v).end()#define RALL(v) (v).rbegin(), (v).rend()#define FOR(i, a, b) for(int i = (a); i < int(b); i++)#define REP(i, n) FOR(i, 0, n)const int INF = 1 << 30;const ll LLINF = 1LL << 60;constexpr int MOD = 1000000007;const int dx[4] = {1, 0, -1, 0};const int dy[4] = {0, 1, 0, -1};//-------------------------------------#line 1 "/home/siro53/kyo-pro/compro_library/math/modint.hpp"template <int mod> struct ModInt {int x;ModInt() : x(0) {}ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod)x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod)x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int)(1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inv();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inv() const {int a = x, b = mod, u = 1, v = 0, t;while(b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return ModInt(u);}ModInt pow(int64_t n) const {ModInt ret(1), mul(x);while(n > 0) {if(n & 1)ret *= mul;mul *= mul;n >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p) {return os << p.x;}friend istream &operator>>(istream &is, ModInt &a) {int64_t t;is >> t;a = ModInt<mod>(t);return (is);}static int get_mod() { return mod; }};#line 3 "c.cpp"using mint = ModInt<MOD>;string s;// dp[何桁目][mod 100][未満フラグ]mint dp[10010][100][2];int main() {cin >> s;int len = s.size();REP(i, len) {const int lim = s[i] - '0';REP(r, 100) {FOR(num, 1, 10) {int nxt_r = (r * num) % 100;dp[i+1][nxt_r][1] += dp[i][r][1];if(num == lim) {dp[i+1][nxt_r][0] += dp[i][r][0];}else if(num < lim) {dp[i+1][nxt_r][1] += dp[i][r][0];}}}FOR(num, 1, 10) {if(i > 0) dp[i+1][num][1] += 1;else if (num == lim) dp[i+1][num][0] += 1;else if(num < lim) dp[i+1][num][1] += 1;}}mint ans = 0;REP(f, 2) ans += dp[len][0][f];cout << ans << endl;}