結果
問題 | No.1417 100の倍数かつ正整数(2) |
ユーザー |
![]() |
提出日時 | 2021-03-05 21:42:18 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 404 ms / 3,000 ms |
コード長 | 4,490 bytes |
コンパイル時間 | 1,342 ms |
コンパイル使用メモリ | 134,124 KB |
最終ジャッジ日時 | 2025-01-19 10:46:41 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#include <iostream>#include <cstdio>#include <cstdlib>#include <algorithm>#include <cmath>#include <vector>#include <set>#include <map>#include <unordered_set>#include <unordered_map>#include <queue>#include <ctime>#include <cassert>#include <complex>#include <string>#include <cstring>#include <chrono>#include <random>#include <bitset>#include <fstream>using namespace std;#define int long long#define ii pair <int, int>#define app push_back#define all(a) a.begin(), a.end()#define bp __builtin_popcountll#define ll long long#define mp make_pair#define x first#define y second#define Time (double)clock()/CLOCKS_PER_SEC#define debug(x) std::cerr << #x << ": " << x << '\n';#define FOR(i, n) for (int i = 0; i < n; ++i)#define pb push_back#define trav(a, x) for (auto& a : x)using vi = vector<int>;template <typename T>std::ostream& operator <<(std::ostream& output, const pair <T, T> & data){output << "(" << data.x << "," << data.y << ")";return output;}template <typename T>std::ostream& operator <<(std::ostream& output, const std::vector<T>& data){for (const T& x : data)output << x << " ";return output;}ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded upll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded downll math_mod(ll a, ll b) { return a - b * div_down(a, b); }#define tcT template<class T#define tcTU tcT, class UtcT> using V = vector<T>;tcT> void re(V<T>& x) {trav(a, x)cin >> a;}tcT> bool ckmin(T& a, const T& b) {return b < a ? a = b, 1 : 0;} // set a = min(a,b)tcT> bool ckmax(T& a, const T& b) {return a < b ? a = b, 1 : 0;}ll gcd(ll a, ll b) {while (b) {tie(a, b) = mp(b, a % b);}return a;}//need define int long longnamespace Stuff {const int MOD = 1e9+7;int mod(int n) {n %= MOD;if (n < 0) return n + MOD;else return n;}int fp(int a, int p) {int ans = 1, c = a;for (int i = 0; (1ll << i) <= p; ++i) {if ((p >> i) & 1) ans = mod(ans * c);c = mod(c * c);}return ans;}int dv(int a, int b) { return mod(a * fp(b, MOD - 2)); }};struct M {ll x;M (int x_) { x = Stuff::mod(x_); }M () { x = 0; }M operator + (M y) {int ans = x + y.x;if (ans >= Stuff::MOD)ans -= Stuff::MOD;return M(ans);}M operator - (M y) {int ans = x - y.x;if (ans < 0)ans += Stuff::MOD;return M(ans);}M operator * (M y) { return M(x * y.x % Stuff::MOD); }M operator / (M y) { return M(x * Stuff::fp(y.x, Stuff::MOD - 2) % Stuff::MOD); }M operator + (int y) { return (*this) + M(y); }M operator - (int y) { return (*this) - M(y); }M operator * (int y) { return (*this) * M(y); }M operator / (int y) { return (*this) / M(y); }M operator ^ (int p) { return M(Stuff::fp(x, p)); }void operator += (M y) { *this = *this + y; }void operator -= (M y) { *this = *this - y; }void operator *= (M y) { *this = *this * y; }void operator /= (M y) { *this = *this / y; }void operator += (int y) { *this = *this + y; }void operator -= (int y) { *this = *this - y; }void operator *= (int y) { *this = *this * y; }void operator /= (int y) { *this = *this / y; }void operator ^= (int p) { *this = *this ^ p; }bool operator == (M y) { return x == y.x; }};std::ostream& operator << (std::ostream& o, const M& a){cout << a.x;return o;}map <ii, M> dp;M ans = 0;int n;string s;M solve_less(int r, int cur) {if (r == 0) {M ans = 0;if (cur == 100)ans = 1;return ans;}if (dp.count(mp(r, cur)))return dp[mp(r, cur)];for (int c = 1; c < 10; ++c) {dp[mp(r, cur)] += solve_less(r - 1, gcd(cur * c, 100));}return dp[mp(r, cur)];}void solve(int i, int cur) {if (i == n) {if (cur == 100) {ans += 1;}return;}int C = s[i] - '0';for (int c = 1; c < C; ++c) {ans += solve_less(n - i - 1, gcd(cur * c, 100));}if (C == 0)return;solve(i + 1, gcd(cur * C, 100));}signed main() {#ifdef ONLINE_JUDGE#define endl '\n'ios_base::sync_with_stdio(0); cin.tie(0);#endifcin >> s;n = s.size();for (int len = 1; len < n; ++len) {ans += solve_less(len, 1);}solve(0, 1);cout << ans << endl;}