結果
問題 | No.2724 Coprime Game 1 |
ユーザー | rikein12 |
提出日時 | 2024-04-12 21:50:12 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,422 bytes |
コンパイル時間 | 2,137 ms |
コンパイル使用メモリ | 203,252 KB |
実行使用メモリ | 30,764 KB |
最終ジャッジ日時 | 2024-10-02 23:12:47 |
合計ジャッジ時間 | 3,584 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
30,420 KB |
testcase_01 | AC | 29 ms
30,416 KB |
testcase_02 | WA | - |
testcase_03 | AC | 169 ms
30,548 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
ソースコード
#line 2 "lib/base/base.hpp" #include<bits/stdc++.h> using namespace std; #define rep(i,n) for(int (i)=0;(i)<(n);++(i)) #define rep3(i,m,n) for(int (i)=(m);(i)<(n);++(i)) #define endl '\n' #define all(v) (v).begin(),(v).end() using ll = long long; using vi = vector<int>; using vvi = vector<vi>; using vll = vector<ll>; using vvll = vector<vll>; template <class T> using uset = unordered_set<T>; template <class S, class T> using umap = unordered_map<S, T>; using pii = pair<int, int>; using pll = pair<ll, ll>; template <class T> using gprique = priority_queue<T, vector<T>, greater<T>>; template <class T> using lprique = priority_queue<T, vector<T>, less<T>>; const int mod998 = 998244353; const int mod107 = 1000000007; #line 2 "lib/utility/io.hpp" #define INT(...) \ int __VA_ARGS__; \ IN(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ IN(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ IN(__VA_ARGS__) #define CHR(...) \ char __VA_ARGS__; \ IN(__VA_ARGS__) #define DBL(...) \ long double __VA_ARGS__; \ IN(__VA_ARGS__) #define VEC(type, name, size) \ vector<type> name(size); \ read(name) #define VV(type, name, h, w) \ vector<vector<type>> name(h, vector<type>(w)); \ read(name) void read(int &a) { cin >> a; } void read(long long &a) { cin >> a; } void read(char &a) { cin >> a; } void read(double &a) { cin >> a; } void read(long double &a) { cin >> a; } void read(string &a) { cin >> a; } template <class T, class S> void read(pair<T, S> &p) { read(p.first), read(p.second); } template <class T> void read(vector<T> &a) {for(auto &i : a) read(i);} template <class T> void read(T &a) { cin >> a; } void IN() {} template <class Head, class... Tail> void IN(Head &head, Tail &...tail) { read(head); IN(tail...); } template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& A) { os << A.first << " " << A.second; return os; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& A) { for (size_t i = 0; i < A.size(); i++) { if(i) os << " "; os << A[i]; } return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& A) { int count = 0; os << "{"; for(auto [t, u] : A){ if(count) os << ", "; os << t << ": " << u; count++; } os << "}"; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& A) { for(auto it = A.begin(); it != A.end(); ++it){ if (it != A.begin()) os << " "; os << (*it); } return os; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& A) { size_t count = 0; T prev; os << "{"; bool is_null = true, is_first = true; for(auto it = A.begin(); it != A.end(); ++it){ if(it == A.begin()) { is_null = false; prev = (*it); count = 1; } if (prev != (*it)){ if(!is_first) os << ", "; is_first = false; os << prev << ": " << count; prev = (*it); count = 1; } else { ++count; } } if(!is_null){ if(!is_first) os << ", "; is_first = false; os << prev << ": " << count; } os << "}"; return os; } void print() { cout << "\n"; cout.flush(); } template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { cout << head; if (sizeof...(Tail)) cout << " "; print(forward<Tail>(tail)...); } void YES(bool t = 1) { print(t ? "YES" : "NO"); } void NO(bool t = 1) { YES(!t); } void Yes(bool t = 1) { print(t ? "Yes" : "No"); } void No(bool t = 1) { Yes(!t); } void yes(bool t = 1) { print(t ? "yes" : "no"); } void no(bool t = 1) { yes(!t); } #line 3 "main.cpp" bool is_prime[3000020]; int cum_prime[3000020]; int lpf[3000020]; vi primes; void linear_sieve(int n){ rep(i,n+1)lpf[i]=-1; rep3(d,2,n+1){ if (lpf[d]==-1){ lpf[d] = d; is_prime[d] = true; primes.push_back(d); } for(auto p: primes){ if (p*d > n || p > lpf[d]) break; lpf[p*d] = p; } } } void solve(){ int n; cin >> n; int chance = n - 1 - (cum_prime[n-1] - cum_prime[n/2]); if (chance%2==0)print("K"); else print("P"); } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); linear_sieve(3000001); cum_prime[0] = 0; rep3(i, 1, 3000001) cum_prime[i] = is_prime[i] + cum_prime[i-1]; int t; cin >> t; rep(i,t)solve(); }