結果
| 問題 | No.2725 Coprime Game 2 |
| ユーザー |
 fuppy_kyopro
|
| 提出日時 | 2024-04-12 22:36:35 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,601 bytes |
| コンパイル時間 | 2,396 ms |
| コンパイル使用メモリ | 197,788 KB |
| 最終ジャッジ日時 | 2025-02-21 00:33:14 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 6 WA * 2 |
ソースコード
/*#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")//*/#include <bits/stdc++.h>// #include <atcoder/all>// #include <atcoder/math>using namespace std;// using namespace atcoder;// #define _GLIBCXX_DEBUG#define DEBUG(x) cerr << #x << ": " << x << endl;#define DEBUG_VEC(v) \cerr << #v << ":"; \for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \cerr << " " << v[iiiiiiii]; \cerr << endl;#define DEBUG_MAT(v) \cerr << #v << endl; \for (int iv = 0; iv < v.size(); iv++) { \for (int jv = 0; jv < v[iv].size(); jv++) { \cerr << v[iv][jv] << " "; \} \cerr << endl; \}typedef long long ll;// #define int ll#define vi vector<int>#define vl vector<ll>#define vii vector<vector<int>>#define vll vector<vector<ll>>#define pii pair<int, int>#define pis pair<int, string>#define psi pair<string, int>#define pll pair<ll, ll>template <class S, class T>pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {return pair<S, T>(s.first + t.first, s.second + t.second);}template <class S, class T>pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }template <class S, class T>ostream &operator<<(ostream &os, pair<S, T> p) {os << "(" << p.first << ", " << p.second << ")";return os;}#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)#define REP(i, a, b) for (int i = a; i < b; i++)#define in(x, a, b) (a <= x && x < b)#define all(c) c.begin(), c.end()void YES(bool t = true) {cout << (t ? "YES" : "NO") << endl;}void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }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 (a > b) {a = b;return 1;}return 0;}#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());const ll inf = 1000000001;const ll INF = (ll)1e18 + 1;const long double pi = 3.1415926535897932384626433832795028841971L;int popcount(ll t) { return __builtin_popcountll(t); }// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};struct Setup_io {Setup_io() {ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);cout << fixed << setprecision(25);cerr << fixed << setprecision(25);}} setup_io;constexpr ll MOD = 1000000007;// constexpr ll MOD = 998244353;// #define mp make_pair// #define endl '\n'constexpr int N = 3000111;vector<int> is_prime(N, true);ll gcd(ll a, ll b) {if (b > a) {swap(a, b);}if (b == 0) return a;ll r = a % b;while (r != 0) {a = b;b = r;r = a % b;}return b;}ll lcm(ll a, ll b) {return (a / gcd(a, b)) * b;}bool dfs(int y, int n, vi &memo) {if (memo[n] != -1) {return memo[n];}bool has_loose = false;for (int x = 2; x < y; x++) {if (gcd(x, y) != 1) {continue;}if (n % x == 0) {continue;}if (!dfs(x, n, memo)) {has_loose = true;break;}}return memo[y] = has_loose;}bool guchoku(ll n) {if (n == 1) {return false;}vi memo(n + 1, -1);return dfs(n, n, memo);}signed main() {is_prime[0] = is_prime[1] = false;for (int i = 2; i < N; i++) {if (is_prime[i]) {for (int j = i * 2; j < N; j += i) {is_prime[j] = false;}}}int t;cin >> t;vi ret;rep1(q, t) {ll n;cin >> n;if (n == 2) {cout << "P" << endl;continue;}if (n % 12 == 6) {cout << "P" << endl;continue;}if (n % (2520LL * 11 * 13 * 17 * 19 * 23 * 29 * 31) == 0) {cout << "K" << endl;continue;}if (n % 420 == 0 and n % 2520 != 0) {cout << "P" << endl;continue;}cout << "K" << endl;continue;// ret.push_back(guchoku(2520LL * 11 * 13 * 17 * 19 * 23 * 29 * 31));// if (ret.back() == 0) {// if (q > 2 and q % 12 != 6 and (q % 420 != 0 or q % 2520 == 0)) {// DEBUG(q);// }// } else {// if (q % 12 == 6) {// DEBUG(q);// }// if (q % 420 == 0 and q % 2520 != 0) {// DEBUG(q);// }// // assert(q % 12 != 6);// }}// DEBUG_VEC(ret);}