結果

問題 No.1532 Different Products
ユーザー optopt
提出日時 2021-06-04 23:05:39
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 777 ms / 4,000 ms
コード長 5,211 bytes
コンパイル時間 4,066 ms
コンパイル使用メモリ 271,064 KB
実行使用メモリ 205,052 KB
最終ジャッジ日時 2024-11-20 06:24:18
合計ジャッジ時間 28,125 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 7 ms
7,936 KB
testcase_01 AC 117 ms
85,560 KB
testcase_02 AC 19 ms
18,816 KB
testcase_03 AC 9 ms
9,600 KB
testcase_04 AC 13 ms
13,312 KB
testcase_05 AC 6 ms
7,040 KB
testcase_06 AC 14 ms
14,208 KB
testcase_07 AC 20 ms
18,944 KB
testcase_08 AC 22 ms
20,480 KB
testcase_09 AC 47 ms
37,000 KB
testcase_10 AC 111 ms
73,128 KB
testcase_11 AC 93 ms
64,136 KB
testcase_12 AC 236 ms
119,576 KB
testcase_13 AC 116 ms
69,288 KB
testcase_14 AC 615 ms
198,492 KB
testcase_15 AC 21 ms
18,944 KB
testcase_16 AC 157 ms
122,164 KB
testcase_17 AC 89 ms
61,256 KB
testcase_18 AC 67 ms
45,960 KB
testcase_19 AC 209 ms
108,116 KB
testcase_20 AC 555 ms
184,076 KB
testcase_21 AC 186 ms
135,320 KB
testcase_22 AC 130 ms
80,008 KB
testcase_23 AC 81 ms
50,392 KB
testcase_24 AC 493 ms
176,168 KB
testcase_25 AC 246 ms
129,348 KB
testcase_26 AC 62 ms
49,668 KB
testcase_27 AC 225 ms
153,948 KB
testcase_28 AC 178 ms
116,184 KB
testcase_29 AC 204 ms
158,240 KB
testcase_30 AC 286 ms
173,176 KB
testcase_31 AC 304 ms
170,668 KB
testcase_32 AC 374 ms
178,656 KB
testcase_33 AC 266 ms
163,676 KB
testcase_34 AC 500 ms
184,800 KB
testcase_35 AC 373 ms
176,680 KB
testcase_36 AC 486 ms
189,824 KB
testcase_37 AC 200 ms
157,088 KB
testcase_38 AC 534 ms
190,488 KB
testcase_39 AC 450 ms
182,012 KB
testcase_40 AC 452 ms
182,508 KB
testcase_41 AC 629 ms
199,352 KB
testcase_42 AC 594 ms
196,524 KB
testcase_43 AC 622 ms
195,996 KB
testcase_44 AC 691 ms
204,796 KB
testcase_45 AC 650 ms
204,924 KB
testcase_46 AC 634 ms
204,412 KB
testcase_47 AC 716 ms
204,924 KB
testcase_48 AC 777 ms
204,796 KB
testcase_49 AC 662 ms
204,796 KB
testcase_50 AC 642 ms
204,800 KB
testcase_51 AC 648 ms
205,048 KB
testcase_52 AC 657 ms
204,604 KB
testcase_53 AC 654 ms
205,052 KB
testcase_54 AC 639 ms
204,540 KB
testcase_55 AC 649 ms
204,920 KB
testcase_56 AC 666 ms
204,412 KB
testcase_57 AC 666 ms
204,284 KB
testcase_58 AC 655 ms
204,796 KB
testcase_59 AC 654 ms
203,932 KB
testcase_60 AC 664 ms
205,052 KB
testcase_61 AC 5 ms
6,400 KB
testcase_62 AC 4 ms
6,400 KB
testcase_63 AC 660 ms
204,920 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
// input and output of modint
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); }
template<int m> istream &operator>>(istream &is, static_modint<m> &a) { long long v; is >> v; a = v; return is; }
template<int m> ostream &operator<<(ostream &os, const static_modint<m> &a) { return os << a.val(); }
template<int m> istream &operator>>(istream &is, dynamic_modint<m> &a) { long long v; is >> v; a = v; return is; }
template<int m> ostream &operator<<(ostream &os, const dynamic_modint<m> &a) { return os << a.val(); }
#define rep_(i, a_, b_, a, b, ...) for (int i = (a), lim##i = (b); i < lim##i; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define drep_(i, a_, b_, a, b, ...) for (int i = (a)-1, lim##i = (b); i >= lim##i; --i)
#define drep(i, ...) drep_(i, __VA_ARGS__, __VA_ARGS__, __VA_ARGS__, 0)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <class Head, class... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
using ll = long long;
using ld = long double;
using Vi = V<int>;  using VVi = VV<int>;
using Vl = V<ll>;   using VVl = VV<ll>;
using Vd = V<ld>;   using VVd = VV<ld>;
using Vb = V<bool>; using VVb = VV<bool>;
template<class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
template<class T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class T> inline int sz(const T &x) { return x.size(); }
template<class T> inline bool chmin(T &a, const T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T &a, const T b) { if (a < b) { a = b; return true; } return false; }
template<class T1, class T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template<class T, size_t n> istream &operator>>(istream &is, array<T, n> &v) { for (auto &e : v) is >> e; return is; }
template<class T, size_t n> ostream &operator<<(ostream &os, const  array<T, n> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<class T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> istream &operator>>(istream &is, deque<T> &v) { for (auto &e : v) is >> e; return is; }
template<class T> ostream &operator<<(ostream &os, const deque<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> inline void deduplicate(vector<T> &a) { sort(all(a)); a.erase(unique(all(a)), a.end()); }
template<class T> inline int count_between(const vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline ll ceil_div(const ll x, const ll y) { return (x+y-1) / y; } // ceil(x/y)
inline int floor_log2(const ll x) { assert(x > 0); return 63 - __builtin_clzll(x); } // floor(log2(x))
inline int ceil_log2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64 - __builtin_clzll(x-1); } // ceil(log2(x))
inline int popcount(const ll x) { return __builtin_popcountll(x); }
inline void fail() { cout << -1 << '\n'; exit(0); }
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
// constexpr int INF = numeric_limits<int>::max() >> 1;
// constexpr ll INFll = numeric_limits<ll>::max() >> 1;
// constexpr ld EPS = 1e-10;
// const ld PI = acos(-1.0);
// using mint = modint998244353;
// using mint = modint1000000007;
// using mint = modint;
// using Vm = V<mint>; using VVm = V<Vm>;


constexpr int m = 2e5;
unordered_map<ll, ll> memo[202];
VVi pre;

ll dp(int n, ll k) {
  if (k == 0) return 0;
  if (n == 0) return 1;
  if (k <= m) return pre[n][k];
  if (memo[n].count(k)) return memo[n][k];
  return memo[n][k] = dp(n-1, k) + dp(n-1, k/n);
}

int main() {
  ll n, k; cin >> n >> k;
  pre.assign(n+1, Vi(m+1, 0));
  pre[0][1] = 1;
  rep(i, n) rep(j, m+1) {
    pre[i+1][j] += pre[i][j];
    int k = j * (i+1);
    if (k <= m) pre[i+1][k] += pre[i][j];
  }
  rep(i, 1, n+1) rep(j, m) pre[i][j+1] += pre[i][j];
  cout << (dp(n, k) - 1) << '\n';
}
0