题解 | #小红和小紫的取素因子游戏#

#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <numeric>
#include <ctime>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
using ll = long long;

const ll N = 1e5 + 5, mod = 1e9 + 7, inf = 2e18;

ll n, a, b;

bool check(int n) {
    if (n == 1)return false;
    if (n == 2)return true;

    if (n % 2 == 0)return false;

    for (int i = 3; i * i <= n; i += 2) {
        if (n % i == 0)return false;
    }

    return true;
}

void solve() {
    cin >> n;
    vector<ll>ans;

    for (int i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            ans.push_back(i);
            n /= i;
        }
    }

    cout << ((ans.size() + (n > 1)) % 2 == 1 ? "kou" : "yukari") << '\n';

}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int t = 1;
    cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}