結果
問題 | No.1409 Simple Math in yukicoder |
ユーザー | minato |
提出日時 | 2021-02-27 11:12:28 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,845 ms / 2,000 ms |
コード長 | 5,593 bytes |
コンパイル時間 | 2,569 ms |
コンパイル使用メモリ | 211,616 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-04-10 15:29:40 |
合計ジャッジ時間 | 73,236 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 3 ms
6,944 KB |
testcase_06 | AC | 3 ms
6,940 KB |
testcase_07 | AC | 95 ms
6,940 KB |
testcase_08 | AC | 328 ms
6,944 KB |
testcase_09 | AC | 83 ms
6,940 KB |
testcase_10 | AC | 244 ms
6,940 KB |
testcase_11 | AC | 304 ms
6,940 KB |
testcase_12 | AC | 236 ms
6,944 KB |
testcase_13 | AC | 94 ms
6,940 KB |
testcase_14 | AC | 75 ms
6,940 KB |
testcase_15 | AC | 110 ms
6,940 KB |
testcase_16 | AC | 116 ms
6,944 KB |
testcase_17 | AC | 411 ms
6,940 KB |
testcase_18 | AC | 201 ms
6,944 KB |
testcase_19 | AC | 221 ms
6,940 KB |
testcase_20 | AC | 174 ms
6,940 KB |
testcase_21 | AC | 140 ms
6,940 KB |
testcase_22 | AC | 290 ms
6,940 KB |
testcase_23 | AC | 58 ms
6,944 KB |
testcase_24 | AC | 46 ms
6,944 KB |
testcase_25 | AC | 270 ms
6,944 KB |
testcase_26 | AC | 278 ms
6,944 KB |
testcase_27 | AC | 465 ms
6,940 KB |
testcase_28 | AC | 441 ms
6,940 KB |
testcase_29 | AC | 453 ms
6,944 KB |
testcase_30 | AC | 451 ms
6,944 KB |
testcase_31 | AC | 458 ms
6,944 KB |
testcase_32 | AC | 425 ms
6,940 KB |
testcase_33 | AC | 448 ms
6,940 KB |
testcase_34 | AC | 434 ms
6,940 KB |
testcase_35 | AC | 452 ms
6,940 KB |
testcase_36 | AC | 465 ms
6,944 KB |
testcase_37 | AC | 1,728 ms
6,944 KB |
testcase_38 | AC | 1,721 ms
6,944 KB |
testcase_39 | AC | 1,750 ms
6,940 KB |
testcase_40 | AC | 1,715 ms
6,940 KB |
testcase_41 | AC | 1,729 ms
6,944 KB |
testcase_42 | AC | 1,732 ms
6,944 KB |
testcase_43 | AC | 1,751 ms
6,940 KB |
testcase_44 | AC | 1,736 ms
6,940 KB |
testcase_45 | AC | 1,740 ms
6,940 KB |
testcase_46 | AC | 1,735 ms
6,944 KB |
testcase_47 | AC | 1,737 ms
6,940 KB |
testcase_48 | AC | 1,743 ms
6,940 KB |
testcase_49 | AC | 1,740 ms
6,944 KB |
testcase_50 | AC | 1,730 ms
6,940 KB |
testcase_51 | AC | 1,732 ms
6,944 KB |
testcase_52 | AC | 1,763 ms
6,940 KB |
testcase_53 | AC | 1,737 ms
6,940 KB |
testcase_54 | AC | 1,755 ms
6,944 KB |
testcase_55 | AC | 1,757 ms
6,940 KB |
testcase_56 | AC | 1,793 ms
6,940 KB |
testcase_57 | AC | 1,828 ms
6,944 KB |
testcase_58 | AC | 1,845 ms
6,944 KB |
testcase_59 | AC | 1,828 ms
6,944 KB |
ソースコード
#pragma GCC optimize("Ofast") #include <bits/stdc++.h> using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; using pll = pair<long long, long long>; template <class T> using vec = vector<T>; template <class T> using vvec = vector<vector<T>>; #define rep(i, n) for (int i = 0; i < (n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) constexpr char ln = '\n'; template <class Container> inline int SZ(const Container& v) { return int(v.size()); } template <class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); } template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); } inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); } inline int popcount(ull x) { return __builtin_popcountll(x); } inline int kthbit(ull x, int k) { return (x >> k) & 1; } inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; } const string YESNO[2] = {"NO", "YES"}; const string YesNo[2] = {"No", "Yes"}; inline void YES(bool t = true) { cout << YESNO[t] << "\n"; } inline void Yes(bool t = true) { cout << YesNo[t] << "\n"; } template <class T> inline void drop(T x) { cout << x << "\n"; exit(0); } inline void print() { cout << "\n"; } template <class T> inline void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << *it; } print(); } template <class T, class... Args> inline void print(const T& x, const Args& ... args) { cout << x << " "; print(args...); } #ifdef MINATO_LOCAL template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << "(" << p.first << ", " << p.second << ")"; } template <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; } template <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); } template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << "("; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << ")"; } string debug_delim(int& i) { return i++ == 0 ? "" : ", "; } #define debug_embrace(x) { int i = 0; os << "{"; { x } return os << "}"; } template <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) } template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) } template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) } template <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) } template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) } template <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) } template <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) } template <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) } template <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) } template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) } void debug_out() { cerr << endl; } template <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); } #define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__) #else #define debug(...) (void(0)) #endif struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(7); }; } fast_ios_; /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #include <atcoder/math> using namespace atcoder; const int MAX = 100000; int PFT[MAX+1]; ll table[MAX+1]; int scan() { int ret; cin >> ret; return ret; } void solve() { const int v = scan(); const int x = scan(); const int P = x * v + 1; for (int i = 1; i < P; i++) { if (PFT[i]==i) { table[i] = pow_mod(i,x,P); } else{ int a = PFT[i]; int b = i / a; table[i] = table[a] * table[b] % P; } if (table[i]==1) cout << i << " "; } cout << ln; } int main() { iota(all(PFT),0); for (int i = 2; i * i <= MAX; i++) { if (PFT[i] == i) { for (int j = i * i; j <= MAX; j += i) { if (PFT[j] == j) PFT[j] = i; } } } int Q; cin >> Q; for (int q = 0; q < Q; q++) { solve(); } }