結果

問題 No.1532 Different Products
ユーザー optopt
提出日時 2021-06-04 22:44:41
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 3,379 ms / 4,000 ms
コード長 4,921 bytes
コンパイル時間 5,320 ms
コンパイル使用メモリ 269,672 KB
実行使用メモリ 199,720 KB
最終ジャッジ日時 2023-12-20 18:16:37
合計ジャッジ時間 114,592 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,676 KB
testcase_01 AC 436 ms
39,736 KB
testcase_02 AC 2 ms
6,676 KB
testcase_03 AC 2 ms
6,676 KB
testcase_04 AC 2 ms
6,676 KB
testcase_05 AC 2 ms
6,676 KB
testcase_06 AC 2 ms
6,676 KB
testcase_07 AC 3 ms
6,676 KB
testcase_08 AC 5 ms
6,676 KB
testcase_09 AC 76 ms
13,184 KB
testcase_10 AC 548 ms
46,812 KB
testcase_11 AC 356 ms
35,604 KB
testcase_12 AC 1,693 ms
110,184 KB
testcase_13 AC 673 ms
53,788 KB
testcase_14 AC 2,681 ms
164,768 KB
testcase_15 AC 7 ms
6,676 KB
testcase_16 AC 465 ms
45,044 KB
testcase_17 AC 352 ms
34,960 KB
testcase_18 AC 208 ms
25,208 KB
testcase_19 AC 1,587 ms
107,104 KB
testcase_20 AC 2,676 ms
167,724 KB
testcase_21 AC 706 ms
61,248 KB
testcase_22 AC 808 ms
64,120 KB
testcase_23 AC 295 ms
31,588 KB
testcase_24 AC 2,537 ms
156,592 KB
testcase_25 AC 1,290 ms
94,464 KB
testcase_26 AC 83 ms
14,720 KB
testcase_27 AC 1,030 ms
80,016 KB
testcase_28 AC 740 ms
63,172 KB
testcase_29 AC 736 ms
61,776 KB
testcase_30 AC 1,500 ms
106,656 KB
testcase_31 AC 1,538 ms
107,396 KB
testcase_32 AC 1,844 ms
122,092 KB
testcase_33 AC 1,320 ms
95,984 KB
testcase_34 AC 2,221 ms
145,812 KB
testcase_35 AC 1,767 ms
121,156 KB
testcase_36 AC 2,323 ms
143,596 KB
testcase_37 AC 503 ms
43,136 KB
testcase_38 AC 2,475 ms
151,852 KB
testcase_39 AC 2,160 ms
136,828 KB
testcase_40 AC 2,192 ms
139,512 KB
testcase_41 AC 3,089 ms
190,896 KB
testcase_42 AC 2,743 ms
171,760 KB
testcase_43 AC 2,921 ms
178,932 KB
testcase_44 AC 3,156 ms
195,620 KB
testcase_45 AC 3,158 ms
196,676 KB
testcase_46 AC 3,070 ms
188,468 KB
testcase_47 AC 3,303 ms
198,828 KB
testcase_48 AC 3,240 ms
196,480 KB
testcase_49 AC 3,283 ms
197,132 KB
testcase_50 AC 3,354 ms
195,548 KB
testcase_51 AC 3,379 ms
198,544 KB
testcase_52 AC 3,147 ms
193,048 KB
testcase_53 AC 3,261 ms
198,880 KB
testcase_54 AC 3,109 ms
193,040 KB
testcase_55 AC 3,257 ms
197,048 KB
testcase_56 AC 3,039 ms
188,392 KB
testcase_57 AC 3,078 ms
189,864 KB
testcase_58 AC 3,216 ms
195,004 KB
testcase_59 AC 3,047 ms
183,148 KB
testcase_60 AC 3,345 ms
199,720 KB
testcase_61 AC 2 ms
6,676 KB
testcase_62 AC 2 ms
6,676 KB
testcase_63 AC 3,187 ms
196,780 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>;


unordered_map<ll, ll> memo[202];
ll dp(int n, ll k) {
  if (k == 0) return 0;
  if (n == 0) return 1;
  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;
  cout << (dp(n, k) - 1) << '\n';
}
0