結果
問題 | No.1417 100の倍数かつ正整数(2) |
ユーザー |
![]() |
提出日時 | 2023-10-16 12:11:58 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 10 ms / 3,000 ms |
コード長 | 3,316 bytes |
コンパイル時間 | 1,096 ms |
コンパイル使用メモリ | 122,916 KB |
最終ジャッジ日時 | 2025-02-17 08:02:37 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#include<iostream>#include<vector>#include<algorithm>#include<cstring>#include<cassert>#include<cmath>#include<ctime>#include<iomanip>#include<numeric>#include<stack>#include<queue>#include<map>#include<unordered_map>#include<set>#include<unordered_set>#include<bitset>#include<random>using namespace std;template<int m> struct modint{private:unsigned int value;static constexpr int mod() {return m;}public:constexpr modint(const long long x = 0) noexcept{long long y = x;if(y < 0 || y >= mod()){y %= mod();if(y < 0) y += mod();}value = (unsigned int)y;}constexpr unsigned int val() noexcept {return value;}constexpr modint &operator+=(const modint &other) noexcept{value += other.value;if(value >= mod()) value -= mod();return *this;}constexpr modint &operator-=(const modint &other) noexcept{unsigned int x = value;if(x < other.value) x += mod();x -= other.value;value = x;return *this;}constexpr modint &operator*=(const modint &other) noexcept{unsigned long long x = value;x *= other.value;value = (unsigned int) (x % mod());return *this;}constexpr modint &operator/=(const modint &other) noexcept{return *this *= other.inverse();}constexpr modint inverse() const noexcept{assert(value);long long a = value,b = mod(),x = 1,y = 0;while(b){long long q = a/b;a -= q*b; swap(a,b);x -= q*y; swap(x,y);}return modint(x);}constexpr modint power(long long N) const noexcept{assert(N >= 0);modint p = *this,ret = 1;while(N){if(N & 1) ret *= p;p *= p;N >>= 1;}return ret;}constexpr modint operator+() {return *this;}constexpr modint operator-() {return modint() - *this;}constexpr modint &operator++(int) noexcept {return *this += 1;}constexpr modint &operator--(int) noexcept {return *this -= 1;}friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}};//using mint = modint<998244353>;using mint = modint<1000000007>;string S;mint dp[2][2][3][3];int f(int x,int d){int res = 0;while(x%d == 0) res++,x /= d;return res;}void solve(){cin >> S;int N = (int)S.size();int cur = 0;for(int i = 0;i < N;i++){int nxt = 1-cur;int D = S[i]-'0';for(int j = 0;j < 2;j++)for(int k = 0;k <= 2;k++)for(int l = 0;l <= 2;l++) dp[nxt][j][k][l] = 0;for(int j = 0;j < 2;j++){for(int d = 1;d <= (j ? 9:D);d++)for(int k = 0;k <= 2;k++)for(int l = 0;l <= 2;l++){int nj = j || d < D;int nk = min(2,k+f(d,2));int nl = min(2,l+f(d,5));dp[nxt][nj][nk][nl] += dp[cur][j][k][l];}}for(int d = 1;d <= (i ? 9:D);d++) dp[nxt][i > 0 || d < D][min(2,f(d,2))][min(2,f(d,5))]++;swap(cur,nxt);}mint ans = dp[cur][0][2][2] + dp[cur][1][2][2];cout << ans << endl;}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int tt = 1;//cin >> tt;while(tt--) solve();}