/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 16ms 732.0 KiB
#3 Accepted 24ms 580.0 KiB
#4 Accepted 24ms 764.0 KiB

Code

#include<numeric>
#include<random>
#include <iostream>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <cassert>
#include <chrono>
#include <iomanip>
#include <set>
#include <map>
#include <string>
#include <complex>
#include<vector>
#include<unordered_map>
#include<unordered_set>
#include<cmath>

#ifdef __GNUC__
#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#endif
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using namespace std;
bool c = 1;
inline ll msb(ll x) {
    if (!x)
        return -1;
#ifdef _MSC_VER
    unsigned long ret;
    _BitScanReverse64(&ret, x);
    return ret;
#endif
#ifdef __GNUC__
    int ret = 63 - __builtin_clzll(x);
    return ret;
#endif
    return 0;
}
char b_s(ll k) {
    int b = 0, e = 1e9;
    while (b < e - 1) {
        int m = (b + e) >> 1;
        ll as = m * (m + 1ll) / 2;
        ll bs = m;
        if (as + bs > k)
            e = m;
        else b = m;
    }
    ll v = b * (b + 1ll) / 2 + b;
    if (v == k)
        return 'b';
    else return 'a';
}
void nine11(int tst) {
    ll k; cin >> k;
    cout << b_s(k) << '\n';
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1; cin >> t;
    for (int i = 1; i <= t && c; i++) {
        nine11(i);
    }
    cout.flush();
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1223 C. Infinity Sequence
Contest
Happy New Year 2026
Language
C++17 (G++ 13.2.0)
Submit At
2026-01-06 14:39:55
Judged At
2026-01-06 14:39:55
Judged By
Score
100
Total Time
24ms
Peak Memory
764.0 KiB