結果
問題 | No.1417 100の倍数かつ正整数(2) |
ユーザー |
![]() |
提出日時 | 2021-03-05 22:13:15 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 27 ms / 3,000 ms |
コード長 | 3,513 bytes |
コンパイル時間 | 864 ms |
コンパイル使用メモリ | 93,640 KB |
最終ジャッジ日時 | 2025-01-19 11:14:43 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <vector>#include <queue>#include <set>#include <map>#include <cassert>#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;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; }using namespace std;typedef long long ll;const ll MOD = 1000000007;class ModInt{public:ll v;ModInt(ll _v = 0){if(_v >= MOD) _v %= MOD;v = _v;}ModInt operator+(ll n){return ModInt((v+n)%MOD);}ModInt operator-(ll n){return ModInt((v-n+MOD)%MOD);}ModInt operator*(ll n){if(n >= MOD) n %= MOD;return ModInt((v*n)%MOD);}ModInt operator/(ll n){return ModInt((ModInt(n).inv()*v).v%MOD);}void operator+=(ll n){v = (v+n)%MOD;}void operator-=(ll n){v = (v-n+MOD)%MOD;}void operator*=(ll n){v = (v*n+MOD)%MOD;}ModInt operator+(ModInt n){return ModInt((v+n.v)%MOD);}ModInt operator-(ModInt n){return ModInt((v-n.v+MOD)%MOD);}ModInt operator*(ModInt n){return ModInt((v*n.v)%MOD);}ModInt operator/(ModInt n){return ModInt((n.inv()*v).v%MOD);}void operator+=(ModInt n){v = (v+n.v)%MOD;}void operator-=(ModInt n){v = (v-n.v+MOD)%MOD;}void operator*=(ModInt n){v = (v*n.v)%MOD;}void operator=(ModInt n){v = n.v;}bool operator==(ModInt n){return v == n.v;}bool operator!=(ModInt n){return v != n.v;}void operator=(ll n){v = n%MOD;}ModInt inv(){if(v == 1) return ModInt(1);else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD);}};ostream& operator<<(ostream& os, const ModInt& m){os << m.v;return os;}istream & operator >> (istream &in, ModInt &m){in >> m.v;return in;}using mint = ModInt;mint dp[100001][3][3][2];// xがnで何回割れるかint count(int x, int n){int ans = 0;while(x%n == 0){x /= n;ans++;}return ans;}int main(){ios::sync_with_stdio(false);cin.tie(0);cout << setprecision(10) << fixed;string s; cin >> s;int n = s.size();bool zero = false;int cnt2 = 0, cnt5 = 0;for(int i = 0; i < n; i++){int x = s[i]-'0';for(int j = 1; j <= 9; j++){for(int k = 0; k <= 2; k++)for(int l = 0; l <= 2; l++){dp[i+1][min(2, k+count(j, 2))][min(2, l+count(j, 5))][1] += dp[i][k][l][1];}}if(i > 0){for(int j = 1; j <= 9; j++){dp[i+1][min(2, count(j, 2))][count(j, 5)][1] += 1;}}if(!zero){for(int j = 1; j < x; j++){dp[i+1][min(2, cnt2+count(j, 2))][min(2, cnt5+count(j, 5))][1] += 1;}}if(x == 0){zero = true;}else{cnt2 = min(2, cnt2+count(x, 2));cnt5 = min(2, cnt5+count(x, 5));}}mint ans = dp[n][2][2][1];if(!zero && cnt2 == 2 && cnt5 == 2) ans += 1;cout << ans << endl;}