結果
問題 | No.2187 三立法和 mod 333 |
ユーザー | iiljj |
提出日時 | 2023-01-13 22:05:40 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 100 ms |
コード長 | 13,443 bytes |
コンパイル時間 | 1,479 ms |
コンパイル使用メモリ | 138,436 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-24 17:35:57 |
合計ジャッジ時間 | 2,565 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 3 ms
5,248 KB |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 2 ms
5,248 KB |
testcase_19 | AC | 2 ms
5,248 KB |
testcase_20 | AC | 2 ms
5,248 KB |
testcase_21 | AC | 2 ms
5,248 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 2 ms
5,248 KB |
testcase_26 | AC | 2 ms
5,248 KB |
testcase_27 | AC | 2 ms
5,248 KB |
testcase_28 | AC | 2 ms
5,248 KB |
testcase_29 | AC | 2 ms
5,248 KB |
testcase_30 | AC | 2 ms
5,248 KB |
testcase_31 | AC | 2 ms
5,248 KB |
testcase_32 | AC | 2 ms
5,248 KB |
ソースコード
/* #region Head */// #include <bits/stdc++.h>#include <algorithm>#include <array>#include <bitset>#include <cassert> // assert.h#include <cmath> // math.h#include <cstring>#include <ctime>#include <deque>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <list>#include <map>#include <memory>#include <numeric>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <vector>using namespace std;using ll = long long;using ull = unsigned long long;using ld = long double;using pll = pair<ll, ll>;template <class T> using vc = vector<T>;template <class T> using vvc = vc<vc<T>>;using vll = vc<ll>;using vvll = vvc<ll>;using vld = vc<ld>;using vvld = vvc<ld>;using vs = vc<string>;using vvs = vvc<string>;template <class T, class U> using um = unordered_map<T, U>;template <class T> using pq = priority_queue<T>;template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;template <class T> using us = unordered_set<T>;#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)#define ALL(x) begin(x), end(x)#define SIZE(x) ((ll)(x).size())#define ISIZE(x) ((int)(x).size())#define PERM(c) \sort(ALL(c)); \for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))#define UNIQ(v) v.erase(unique(ALL(v)), v.end());#define CEIL(a, b) (((a) + (b)-1) / (b))#define endl '\n'constexpr ll INF = 1'010'000'000'000'000'017LL;constexpr int IINF = 1'000'000'007LL;constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7// constexpr ll MOD = 998244353;constexpr ld EPS = 1e-12;constexpr ld PI = 3.14159265358979323846;template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力for (T &x : vec) is >> x;return is;}template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)os << "{";REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");return os;}template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力REP(i, 0, SIZE(arr)) is >> arr[i];return is;}template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)os << "{";REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力is >> pair_var.first >> pair_var.second;return is;}template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}// map, um, set, us 出力template <class T> ostream &out_iter(ostream &os, const T &map_var) {os << "{";REPI(itr, map_var) {os << *itr;auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}return os << "}";}template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {return out_iter(os, map_var);}template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {os << "{";REPI(itr, map_var) {auto [key, value] = *itr;os << "(" << key << ", " << value << ")";auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}os << "}";return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {pq<T> pq_cp(pq_var);os << "{";if (!pq_cp.empty()) {os << pq_cp.top(), pq_cp.pop();while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();}return os << "}";}// tuple 出力template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {if constexpr (N < std::tuple_size_v<tuple<Args...>>) {os << get<N>(a);if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {os << ' ';} else if constexpr (end_line) {os << '\n';}return operator<< <N + 1, end_line>(os, a);}return os;}template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<< <0, true>(cout, a); }void pprint() { cout << endl; }template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {cout << head;if (sizeof...(Tail) > 0) cout << ' ';pprint(move(tail)...);}// dump#define DUMPOUT cerrvoid dump_func() { DUMPOUT << endl; }template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {DUMPOUT << head;if (sizeof...(Tail) > 0) DUMPOUT << ", ";dump_func(move(tail)...);}// chmax (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {if (comp(xmax, x)) {xmax = x;return true;}return false;}// chmin (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {if (comp(x, xmin)) {xmin = x;return true;}return false;}// ローカル用#ifndef ONLINE_JUDGE#define DEBUG_#endif#ifndef MYLOCAL#undef DEBUG_#endif#ifdef DEBUG_#define DEB#define dump(...) \DUMPOUT << " " << string(#__VA_ARGS__) << ": " \<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \<< " ", \dump_func(__VA_ARGS__)#else#define DEB if (false)#define dump(...)#endif#define VAR(type, ...) \type __VA_ARGS__; \assert((cin >> __VA_ARGS__));template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }struct AtCoderInitialize {static constexpr int IOS_PREC = 15;static constexpr bool AUTOFLUSH = true;AtCoderInitialize() {ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);cout << fixed << setprecision(IOS_PREC);if (AUTOFLUSH) cout << unitbuf;}} ATCODER_INITIALIZE;void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {for (int i = 0; i < ISIZE(v); ++i) v[i]--;}template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {for (int i = 0; i < ISIZE(v); ++i) v[i]++;}/* #endregion */// #include <atcoder/all>// using namespace atcoder;void sub() {constexpr ll M = 333;vll tbl(M, 0);ll R = 4444LL * 4444LL * 4444LL * 4444LL;REP(x, 1, 4444) {pprint(x);ll x3 = x * x * x;ll x4 = x3 * x;REP(y, 1, 4444) {ll y3 = y * y * y;ll y4 = y3 * y;if (x4 + y4 + 1 > R) break;REP(z, 1, 4444) {ll z3 = z * z * z;ll z4 = z3 * z;if (x4 + y4 + z4 > R) break;tbl[(x3 + y3 + z3) % M]++;}}}dump(tbl);}// Problemvoid solve() {// sub();const vll ans = {353412483, 499853409, 198066141, 65944976, 0, 0, 83359314, 197704749, 499956396, 461596998,499924557, 250031589, 66025737, 0, 0, 65922195, 197880351, 395804754, 461671050, 395752629,197825844, 65951319, 0, 0, 65936360, 197777304, 499639056, 583029498, 395715012, 249552855,66073349, 0, 0, 66026043, 197876565, 395514645, 582863367, 303214194, 249900573, 66080034,0, 0, 65941840, 249952551, 395548158, 583092006, 395796816, 250096923, 83408904, 0,0, 83352606, 197785611, 395734917, 461688090, 395834907, 197910177, 65958885, 0, 0,83129445, 197879421, 395601315, 583179990, 499975596, 197894460, 83217288, 0, 0, 65851552,197977152, 395723337, 461598072, 499492386, 151682058, 83391159, 0, 0, 65982393, 197810568,499698792, 461615477, 499465320, 197929308, 83479962, 0, 0, 66034772, 249868407, 395609340,461586120, 395850384, 197943681, 65989561, 0, 0, 66018201, 249605913, 395763186, 461545017,500244135, 250121904, 65992770, 0, 0, 83439696, 197582427, 395906010, 461534357, 395972283,249747105, 50667829, 0, 0, 65970890, 197840178, 395783145, 582714366, 395839320, 249607272,66034569, 0, 0, 65970813, 197862537, 499837770, 461586033, 395704725, 197937468, 66025153,0, 0, 65971953, 197855130, 499324197, 461779937, 395694588, 250272546, 83394459, 0,0, 65931391, 250137234, 395347209, 461799958, 395664129, 198104688, 83187177, 0, 0,65844093, 197915487, 395640954, 461877100, 499267476, 197996145, 83116794, 0, 0, 83077128,197816517, 395716419, 583089981, 395680647, 197847309, 66034770, 0, 0, 65927544, 197856531,395729877, 582755274, 395784210, 197870754, 83518725, 0, 0, 83482623, 197741811, 500063223,461407793, 395845749, 197818044, 66124482, 0, 0, 83419152, 197585898, 395806743, 461487779,396117981, 249519294, 66035306, 0, 0, 83193621, 249380424, 395683833, 461503212, 500027589,197855943, 65988450, 0, 0, 65930507, 197764092, 395690775, 461566449, 499518105, 197901777,65986020, 0, 0, 65933772, 250096410, 395624835, 583102701, 395703927, 197915679, 65987298,0, 0, 50523021, 249970845, 395405595, 461756184, 395565168, 198146163, 83144547, 0,0, 65983467, 249543381, 499087524, 461617473, 395695518, 250057275, 65957211, 0, 0,65974043, 197782437, 395546595, 461593956, 395765376, 249800436, 65946828, 0, 0, 83100603,197759865, 499933236, 461658190, 499637970, 197937693, 65994989, 0, 0, 83165199, 151389405,499921449, 461545845, 395752965, 197762508, 66111248, 0, 0, 83355123, 197818980, 499370913,582628467, 395794911, 197844207, 83457036, 0, 0, 66017907, 197835168, 395622237, 461486226,395661093, 197892921, 83237010, 0, 0, 83211351, 249550986, 395580453, 582788094, 395923029,249712644, 66025575, 0, 0, 65897514, 249726033, 302922846, 583014219, 395884293, 197863206,65933645, 0, 0, 65893369, 250099782, 395686374, 582793884, 499733808, 197928006, 66021523,0, 0, 66010887, 197890128, 395726169, 461611814, 395609376, 197826183, 66037128, 0,0, 65941779, 249662991, 499401411, 461547663, 499391031, 198039087, 83234613, 0, 0,66018343, 197644773, 499469412};constexpr ll M = 333;VAR(ll, a);a %= M;pprint(ans[a]);}// entry pointint main() {solve();return 0;}