Submission

Score: 100

User: KantaponZ

Problemset: Bakushin's Genius Game

Language: cpp

Time: 0.010 second

Submitted On: 2025-10-17 03:06:51

#include <bits/stdc++.h>
using namespace std;

int ct = 0;
vector<int> prime;
int N, T;
bool isPrime[100005];

void sieve() {
    for (int i = 2; i <= 100000; i++) isPrime[i] = 1;
    for (int i = 2; i * i <= 1000000000; i++) {
        if (isPrime[i]) {
            //cout << "x";
            for (int j = i * i; j <= 100000; j += i) {
                isPrime[j] = 0;
            }
            prime.emplace_back(i);
        }
    }
}


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

    cin >> T;
    while (T--) {
        cin >> N;
        if (N == 0) {
            cout << "B\n";
            continue;
        }
        if (N == 1) {
            cout << "A\n";
            continue;
        }
        if (N == 2) {
            cout << "B\n";
            continue;
        }
        if (N == 3) {
            cout << "A\n";
            continue;
        }
        if (N % 2 == 0) {
            cout << "A\n";
        } else cout << "B\n";
    }

}