結果
問題 | No.153 石の山 |
ユーザー |
![]() |
提出日時 | 2016-12-23 19:47:43 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,193 bytes |
コンパイル時間 | 1,085 ms |
コンパイル使用メモリ | 109,712 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-12-14 17:02:27 |
合計ジャッジ時間 | 2,043 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 27 |
ソースコード
#include <iostream>#include <string>#include <queue>#include <stack>#include <algorithm>#include <list>#include <vector>#include <complex>#include <utility>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <climits>#include <bitset>#include <ctime>#include <map>#include <unordered_map>#include <set>#include <unordered_set>#include <cassert>#include <cstddef>#include <iomanip>#include <numeric>#include <tuple>#include <sstream>#include <fstream>using namespace std;#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)#define DEBUG(C) cerr << #C << " = " << C << endl;using LL = long long;using VI = vector<int>;using VVI = vector<VI>;using VL = vector<LL>;using VVL = vector<VL>;using VD = vector<double>;using VVD = vector<VD>;using PII = pair<int, int>;using PDD = pair<double, double>;using PLL = pair<LL, LL>;using VPII = vector<PII>;template<typename T> using VT = vector<T>;#define ALL(a) begin((a)), end((a))#define RALL(a) rbegin((a)), rend((a))#define SORT(a) sort(ALL((a)))#define RSORT(a) sort(RALL((a)))#define REVERSE(a) reverse(ALL((a)))#define MP make_pair#define FORE(a, b) for (auto &&a : (b))#define FIND(s, e) ((s).find(e) != (s).end())#define EB emplace_backconst int INF = 1e9;const int MOD = INF + 7;const LL LLINF = 1e18;int N;int grandy[110];int calcGrandy(int n) {int &now = grandy[n];if (now != -1) return now;if (n == 1) return now = 0;set<int> se;if (n >= 2) {int g = calcGrandy(n / 2);g ^= calcGrandy((n / 2) + n % 2);se.insert(g);}if (n >= 3) {int g = calcGrandy(n / 3);if (n % 3 == 1) g ^= g ^ calcGrandy((n / 3) + 1);if (n % 3 == 2) g ^= calcGrandy((n / 3) + 1) ^ calcGrandy((n / 3) + 1);se.insert(g);}now = 0;while (FIND(se, now)) now++;return now;}int main(void) {REP(i, 110) grandy[i] = -1;cin >> N;cout << (calcGrandy(N) ? "A" : "B") << endl;}