結果
問題 | No.2721 "Don't say N" Game |
ユーザー |
![]() |
提出日時 | 2024-04-12 21:22:46 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 8 ms / 2,000 ms |
コード長 | 2,294 bytes |
コンパイル時間 | 3,499 ms |
コンパイル使用メモリ | 273,320 KB |
実行使用メモリ | 7,424 KB |
最終ジャッジ日時 | 2024-10-02 22:56:05 |
合計ジャッジ時間 | 4,074 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 5 |
ソースコード
#include<bits/stdc++.h>namespace {#pragma GCC diagnostic ignored "-Wunused-function"#include<atcoder/all>#pragma GCC diagnostic warning "-Wunused-function"using namespace std;using namespace atcoder;#define rep(i,n) for(int i = 0; i < (int)(n); i++)#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }using ll = long long;using P = pair<int,int>;using VI = vector<int>;using VVI = vector<VI>;using VL = vector<ll>;using VVL = vector<VL>;pair<vector<int>, vector<int>> primes_lpf(const int n) {vector<int> primes; primes.reserve(n / 10);vector<int> lpf(n + 1);for (int i = 2; i <= n; i += 2) lpf[i] = 2;for (int i = 3; i <= n; i += 6) lpf[i] = 3;if (2 <= n) primes.push_back(2);if (3 <= n) primes.push_back(3);// 5 * x <= n, x <= floor(n / 5)const int n5 = n / 5;int x = 5;char add_next = 2;for (; x <= n5; x += add_next, add_next ^= 2 ^ 4) {int px = lpf[x];if (px == 0) {lpf[x] = px = x;primes.push_back(x);}for (int i = 2;; ++i) {int q = primes[i];int y = q * x;if (y > n) break;lpf[y] = q;if (q == px) break;}}for (; x <= n; x += add_next, add_next ^= 2 ^ 4) {if (lpf[x] == 0) {lpf[x] = x;primes.push_back(x);}}return {move(primes), move(lpf)};}constexpr int PSIZE = 1000000;auto [primes, lpf] = primes_lpf(PSIZE);vector<int>& divisors_lv(int x) {int ps[10], cs[10];int sz = 0;while (x != 1) {int p = lpf[x], c = 0;do {x /= p; c++;} while (x % p == 0);ps[sz] = p; cs[sz] = c; sz++;}static vector<int> res;res.clear();res.emplace_back(1);for (int i = 0; i < sz; i++) {int p = ps[i], ptr = 0;for (int t = cs[i] * res.size(); t > 0; t--)res.emplace_back(res[ptr++] * p);}return res;}} int main() {ios::sync_with_stdio(false);cin.tie(0);int tt;cin >> tt;while (tt--) {int n;cin >> n;int sz = divisors_lv(n).size();cout << "KP"[sz % 2] << '\n';}}