-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathkthBeatifulstring.cpp
More file actions
60 lines (45 loc) · 1.15 KB
/
kthBeatifulstring.cpp
File metadata and controls
60 lines (45 loc) · 1.15 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
//codeforces.com/contest/1328/problem/B
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define fr(i, n) for(int i = 0; i < n; i++)
#define frr(i, n) for(int i = 1; i <= n; i++)
#define dbg(x) cout << #x << " = " << x << endl
#define all(x) x.begin(),x.end()
#define ms(x, i) memset(x, i, sizeof(x))
#define p(x) cout << x << "\n"
#define pv(x) fr(i, x.size()) cout << x[i] << " \n"[i==x.size()-1]
#define f first
#define s second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f;
int main() {
fastio;
ll t;
cin >> t;
while (t--) {
ll n, k;
cin >> n >> k;
ll cnt = 0ll;
ll i1 = 1ll, i2;
while (k > i1) {
k -= i1;
i1++;
}
i2 = k-1;
string ans;
fr(i, n) {
if (i == i1 || i == i2) ans += 'b';
else ans += 'a';
}
reverse(all(ans));
p(ans);
}
}