#1003432 (C++17) No.2846 Birthday Cake

提出ソース

結果

問題	No.2846 Birthday Cake
ユーザー	apricity
提出日時	2024-08-23 22:55:24
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	2 ms / 2,000 ms
コード長	6,051 bytes
コンパイル時間	1,817 ms
コンパイル使用メモリ	134,656 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-08-23 22:55:27
合計ジャッジ時間	2,633 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	2 ms 6,944 KB
testcase_17	AC	2 ms 6,944 KB
testcase_18	AC	2 ms 6,940 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	2 ms 6,944 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	2 ms 6,944 KB
testcase_24	AC	1 ms 6,944 KB
testcase_25	AC	2 ms 6,944 KB
testcase_26	AC	2 ms 6,944 KB
testcase_27	AC	2 ms 6,944 KB
testcase_28	AC	2 ms 6,940 KB
testcase_29	AC	2 ms 6,944 KB
testcase_30	AC	2 ms 6,940 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	2 ms 6,944 KB
testcase_33	AC	2 ms 6,944 KB
testcase_34	AC	2 ms 6,940 KB
testcase_35	AC	2 ms 6,944 KB
testcase_36	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep1(a)          for(int i = 0; i < a; i++)
#define rep2(i, a)       for(int i = 0; i < a; i++)
#define rep3(i, a, b)    for(int i = a; i < b; i++)
#define rep4(i, a, b, c) for(int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(a)          for(int i = (a)-1; i >= 0; i--)
#define rrep2(i, a)       for(int i = (a)-1; i >= 0; i--)
#define rrep3(i, a, b)    for(int i = (b)-1; i >= a; i--)
#define rrep4(i, a, b, c) for(int i = (b)-1; i >= a; i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using vvvvvc = vector<vvvvc<T>>;
#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

vector<ll> v[24] = {
{1},
{1,1},
{1,1,1},
{1,1,4,1},
{1,1,4,1,1},
{1,1,10,23,16,1},
{1,1,10,23,16,1,1},
{1,1,10,35,91,106,43,1},
{1,1,10,35,121,226,505,309,1},
{1,1,10,47,231,667,1688,1961,640,1},
{1,1,10,47,231,667,1688,1961,640,1,1},
{1,1,10,95,511,2352,8828,20847,26719,11336,694,1},
{1,1,10,95,511,2352,8828,20847,26719,11336,694,1,1},
{1,1,10,95,531,2592,11740,39027,87181,118886,87781,26203,1730,1},
{1,1,10,119,941,6762,37990,180819,662821,1676126,2136223,1562089,595349,98281,1},
{1,1,10,119,1001,7812,50205,298503,1426678,5314931,12998305,16990810,11428613,3589041,204831,1},
{1,1,10,119,1001,7812,50205,298503,1426678,5314931,12998305,16990810,11428613,3589041,204831,1,1},
{1,1,10,143,1321,12612,98967,706351,4519408,23098446,90446137,233499344,359830680,303875573,120897041,15574653,61864,1},
{1,1,10,143,1321,12612,98967,706351,4519408,23098446,90446137,233499344,359830680,303875573,120897041,15574653,61864,1,1},
{1,1,10,167,1851,20562,188049,1637057,12442024,81943326,429039909,1740647525,5233214351,10843887965,14088489255,9982510305,2962502213,198795808,582085,1},
{1,1,10,167,2001,23622,247899,2492121,23603800,200197566,1457497196,8592067529,39580212205,134817405451,309930637885,426337329317,295288749243,73152855670,6996250795,28282071,1},
{1,1,10,167,2001,23622,247941,2492905,23625220,200631786,1464757108,8683726163,40413510762,140147181266,332462625610,484295650621,382283766495,146218113382,38473778130,5684671181,173183578,1},
{1,1,10,167,2001,23622,247941,2492905,23625220,200631786,1464757108,8683726163,40413510762,140147181266,332462625610,484295650621,382283766495,146218113382,38473778130,5684671181,173183578,1,1},
{1,1,10,191,2511,33882,409165,4641625,50103058,496822401,4403064282,33370486316,209225931487,1051662957619,4048971290390,11244715040211,20694326612398,22228226842243,11390082915896,2186175253228,151220665303,2381965422,1643558,1},

};

    // ll l = 1;
    // rep(n,1,25){
    //     vector<ll> ans;
    //     l = lcm(l, n);
    //     map<ll,ll> mp;
    //     mp[0] = 1;
    //     rep(i,n){
    //         map<ll,ll> m2;
    //         for(auto [v,c] : mp) rep(j,1,n+1) if (v+l/j <= l) m2[v + l/j] += c;
    //         ans.pb(m2[l]);
    //         mp = move(m2);
    //     }
    //     out(ans, ",");
    // }
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ll k,n; in(k,n);
    out(v[n-1][k-1]);
}

yukicoder

結果

テストケース

ソースコード