結果

問題 No.1665 quotient replace
ユーザー rniyarniya
提出日時 2021-09-06 17:07:53
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 196 ms / 3,000 ms
コード長 5,393 bytes
コンパイル時間 1,824 ms
コンパイル使用メモリ 203,132 KB
実行使用メモリ 7,292 KB
最終ジャッジ日時 2024-06-02 02:43:28
合計ジャッジ時間 6,664 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 12 ms
7,168 KB
testcase_01 AC 11 ms
7,040 KB
testcase_02 AC 11 ms
7,140 KB
testcase_03 AC 13 ms
7,168 KB
testcase_04 AC 10 ms
7,168 KB
testcase_05 AC 10 ms
7,132 KB
testcase_06 AC 13 ms
7,168 KB
testcase_07 AC 11 ms
6,976 KB
testcase_08 AC 11 ms
7,040 KB
testcase_09 AC 16 ms
7,040 KB
testcase_10 AC 73 ms
7,168 KB
testcase_11 AC 149 ms
7,040 KB
testcase_12 AC 25 ms
7,168 KB
testcase_13 AC 196 ms
7,088 KB
testcase_14 AC 190 ms
7,040 KB
testcase_15 AC 193 ms
7,168 KB
testcase_16 AC 194 ms
7,176 KB
testcase_17 AC 195 ms
7,080 KB
testcase_18 AC 11 ms
7,084 KB
testcase_19 AC 11 ms
7,164 KB
testcase_20 AC 11 ms
7,288 KB
testcase_21 AC 11 ms
7,168 KB
testcase_22 AC 12 ms
7,128 KB
testcase_23 AC 11 ms
7,040 KB
testcase_24 AC 12 ms
7,044 KB
testcase_25 AC 11 ms
6,980 KB
testcase_26 AC 11 ms
7,040 KB
testcase_27 AC 12 ms
7,156 KB
testcase_28 AC 14 ms
7,112 KB
testcase_29 AC 18 ms
7,108 KB
testcase_30 AC 63 ms
7,096 KB
testcase_31 AC 91 ms
7,040 KB
testcase_32 AC 148 ms
7,168 KB
testcase_33 AC 62 ms
7,040 KB
testcase_34 AC 122 ms
6,960 KB
testcase_35 AC 113 ms
7,168 KB
testcase_36 AC 117 ms
7,292 KB
testcase_37 AC 104 ms
7,040 KB
testcase_38 AC 123 ms
7,168 KB
testcase_39 AC 92 ms
7,168 KB
testcase_40 AC 91 ms
7,128 KB
testcase_41 AC 91 ms
7,168 KB
testcase_42 AC 11 ms
7,040 KB
testcase_43 AC 10 ms
7,044 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

template <int i, typename T> void print_tuple(ostream&, const T&) {}
template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {
    if (i) os << ',';
    os << get<i>(t);
    print_tuple<i + 1, T, Args...>(os, t);
}
template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {
    os << '{';
    print_tuple<0, tuple<Args...>, Args...>(os, t);
    return os << '}';
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

/**
 * @brief osa_k法
 * @docs docs/math/prime_factor_table.md
 */
vector<int> prime_factor_table(int n) {
    vector<int> res(n + 1, 0);
    for (int i = 2; i <= n; i++)
        if (!res[i]) {
            for (int j = i; j <= n; j += i) {
                if (!res[j]) res[j] = i;
            }
        }
    return res;
}

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

const int MAX_A = 1000010;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    auto table = prime_factor_table(MAX_A);
    int N;
    cin >> N;
    int grundy = 0;
    for (; N--;) {
        int A;
        cin >> A;
        int cur = 0;
        while (A > 1) {
            cur++;
            A /= table[A];
        }
        grundy ^= cur;
    }

    cout << (grundy ? "white" : "black") << '\n';
    return 0;
}
0