結果

問題 No.1665 quotient replace
ユーザー wait_sushiwait_sushi
提出日時 2021-09-03 21:52:01
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 223 ms / 3,000 ms
コード長 4,698 bytes
コンパイル時間 2,592 ms
コンパイル使用メモリ 216,180 KB
実行使用メモリ 32,052 KB
最終ジャッジ日時 2024-12-15 12:37:39
合計ジャッジ時間 8,488 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 19 ms
22,688 KB
testcase_01 AC 18 ms
22,724 KB
testcase_02 AC 22 ms
22,648 KB
testcase_03 AC 19 ms
22,648 KB
testcase_04 AC 18 ms
22,760 KB
testcase_05 AC 18 ms
22,620 KB
testcase_06 AC 20 ms
22,852 KB
testcase_07 AC 21 ms
22,684 KB
testcase_08 AC 22 ms
22,920 KB
testcase_09 AC 25 ms
23,000 KB
testcase_10 AC 90 ms
27,836 KB
testcase_11 AC 175 ms
31,420 KB
testcase_12 AC 35 ms
23,864 KB
testcase_13 AC 223 ms
31,960 KB
testcase_14 AC 216 ms
31,304 KB
testcase_15 AC 208 ms
31,460 KB
testcase_16 AC 214 ms
31,940 KB
testcase_17 AC 216 ms
32,052 KB
testcase_18 AC 19 ms
22,756 KB
testcase_19 AC 20 ms
22,756 KB
testcase_20 AC 20 ms
22,616 KB
testcase_21 AC 19 ms
22,616 KB
testcase_22 AC 20 ms
22,704 KB
testcase_23 AC 21 ms
22,776 KB
testcase_24 AC 20 ms
22,624 KB
testcase_25 AC 20 ms
22,720 KB
testcase_26 AC 20 ms
22,792 KB
testcase_27 AC 20 ms
22,748 KB
testcase_28 AC 24 ms
23,288 KB
testcase_29 AC 27 ms
23,984 KB
testcase_30 AC 79 ms
27,836 KB
testcase_31 AC 108 ms
31,248 KB
testcase_32 AC 164 ms
31,352 KB
testcase_33 AC 72 ms
27,196 KB
testcase_34 AC 148 ms
31,368 KB
testcase_35 AC 128 ms
31,648 KB
testcase_36 AC 131 ms
31,384 KB
testcase_37 AC 126 ms
27,836 KB
testcase_38 AC 148 ms
32,040 KB
testcase_39 AC 109 ms
27,196 KB
testcase_40 AC 107 ms
26,936 KB
testcase_41 AC 106 ms
27,700 KB
testcase_42 AC 20 ms
22,704 KB
testcase_43 AC 20 ms
22,708 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#pragma comment(linker, "/stack:200000000")
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i < b; ++i)
#define rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for (ll i = n; i--;)
#define rrep2(i, n) for (ll i = n; i--;)
#define rrep3(i, a, b) for (ll i = b; i-- > (a);)
#define rrep4(i, a, b, c)                                                      \
  for (ll i = (a) + ((b) - (a)-1) / (c) * (c); i >= (a); i -= c)
#define rrep(...)                                                              \
  overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define elif else if
ll beki(ll i) { return 1ll << i; }
#define skip(M)                                                                \
  if (M)                                                                       \
  continue
#define all(v) v.begin(), v.end()
#define allm(x, y, M) for (auto [(x), (y)] : (M))
#define alls(i, S) for (auto(&i) : (S))
#define pb push_back
#define fi first
#define se second
const ll INF = (1LL << 61) - 1;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll MAX_N1 = 200010;
const ll MAX_N2 = 500010;
template <class X> void print(X x) { cout << x << endl; }
void print(vl x) {
  for (ll i : x) {
    cout << i << " ";
  }
  cout << endl;
}
void print(vector<PP> x) {
  for (PP i : x) {
    cout << i.first << " " << i.second << endl;
  }
  cout << endl;
}
template <class X> void printr(X x) { cerr << x << endl; }
void printr(vl x) {
  for (ll i : x) {
    cerr << i << " ";
  }
  cerr << endl;
}
void printr(vector<PP> x) {
  for (PP i : x) {
    cerr << i.first << " " << i.second << endl;
  }
  cout << endl;
}
template <class X> int lbound(vector<X> &Y, X a) {
  return lower_bound(all(Y), a) - Y.begin();
}
template <class X> int ubound(vector<X> &Y, X a) {
  return upper_bound(all(Y), a) - Y.begin();
}
template <class X> X lbound2(vector<X> &Y, X a, int mode = 0) {
  int x = lbound(Y, a) - mode;
  if (x < 0 || x >= Y.size())
    return INF;
  return Y[x];
}
template <class X> X ubound2(vector<X> &Y, X a, int mode = 0) {
  int x = ubound(Y, a) - mode;
  if (x < 0 || x >= Y.size())
    return INF;
  return Y[x];
}
template <class... T> void cl(T &... t) { (..., (t.clear())); }
template <class... T> void in(T &... t) { (..., (cin >> t)); }
template <class... T> void put(vl &V, int n, int mode = 0) {
  ll k;
  if (mode == 0)
    cl(V);
  rep(i, n) {
    cin >> k;
    V.pb(k);
  }
}
int max_index(vl &V) { return max_element(all(V)) - V.begin(); }
int min_index(vl &V) { return min_element(all(V)) - V.begin(); }
ll sum(vl &V) { return accumulate(all(V), 0ll); }
template <typename T> void UNIQUE(vector<T> &v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> T ADD(T a, T b) {
  T res;
  return __builtin_add_overflow(a, b, &res) ? numeric_limits<T>::max() : res;
}
template <typename T> T MUL(T a, T b) {
  T res;
  return __builtin_mul_overflow(a, b, &res) ? numeric_limits<T>::max() : res;
};
template <typename T> T POW(T a, int n) {
  T res = 1;
  for (; n > 0; n >>= 1, a *= a)
    if (n & 1)
      res *= a;
  return res;
}
template <class X> bool ma(X &a, X b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class X> bool mi(X &a, X b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
void vset(vl &A, ll n, ll k) { A = vl(n, k); }
void so(vl &A) { sort(all(A)); }
ll age(ll x, ll y) { return (x + y - 1) / y; }
ll a, b, c, d, aa, bb, cc, dd, h, x, y, z, p, q, n, t, r, k, w, l, ans, m, u, v;
ll codeforces = 1;
string S, T, U;
vl A, B, C, D;
vl g[MAX_N2];
vector<PP> VP, VP2;
set<ll> s1, s2;
void solve() {
  in(n);
  put(A, n);
  rep(i, n) {
    k = A[i];
    a = 0;
    while (k > 1) {
      k /= D[k];
      a++;
    }
    ans ^= a;
  }
  if (ans) {
    print("white");
  } else
    print("black");
}
int main() {
  n = MAX_N2 * 2;
  vset(D, n + 1, -1);
  for (ll i = 2; i < n; i++) {
    if (D[i] == -1) {
      D[i] = i;
      for (ll j = 1; j * i <= n; j++) {
        D[j * i] = i;
      }
    }
  }
  cout << fixed << setprecision(15);
  cin.tie(0);
  ios::sync_with_stdio(false);
  // cin >> codeforces;
  while (codeforces--) {
    ans = 0;
    solve();
  }
}
0