結果
問題 | No.153 石の山 |
ユーザー |
|
提出日時 | 2019-10-07 17:50:39 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 27 ms / 5,000 ms |
コード長 | 2,212 bytes |
コンパイル時間 | 2,260 ms |
コンパイル使用メモリ | 199,300 KB |
最終ジャッジ日時 | 2025-01-07 21:16:04 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 27 |
ソースコード
#include <bits/stdc++.h>#define LLI long long int#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)#define REP(v, n) FOR(v, 0, n)#define REPE(v, n) FORE(v, 0, n)#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)#define ALL(x) (x).begin(), (x).end()#define RALL(x) (x).rbegin(), (x).rend()#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)#define EXIST(c,x) ((c).find(x) != (c).end())#define fst first#define snd second#define popcount __builtin_popcount#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())#define bit(i) (1LL<<(i))#ifdef DEBUG#include <misc/C++/Debug.cpp>#else#define dump(...) ((void)0)#endif#define gcd __gcdusing namespace std;template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}struct Init{Init(){cin.tie(0);ios::sync_with_stdio(false);}}init;int g[101];bool check[101];int rec(int N){if(check[N]) return g[N];check[N] = true;set<int> s;if(N >= 2){if(N % 2 == 0) s.insert(rec(N/2) ^ rec(N/2));else s.insert(rec(N/2) ^ rec(N/2+1));}if(N >= 3){if(N % 3 == 0) s.insert(rec(N/3) ^ rec(N/3) ^ rec(N/3));else if(N % 3 == 1) s.insert(rec(N/3) ^ rec(N/3) ^ rec(N/3+1));else s.insert(rec(N/3) ^ rec(N/3+1) ^ rec(N/3+1));}int k = 0;while(EXIST(s,k)) ++k;g[N] = k;return g[N];}bool solve(int N){fill_array(g, 0);fill_array(check, false);return rec(N) != 0;}int main(){int N;while(cin >> N){cout << (solve(N) ? "A" : "B") << endl;}return 0;}