-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA_Recovering_a_Small_String.cpp
70 lines (54 loc) · 1.24 KB
/
A_Recovering_a_Small_String.cpp
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
61
62
63
64
65
66
67
68
69
70
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define min3(a, b, c) min(min(a, b), c)
#define max3(a, b, c) max(max(a, b), c)
#define all(v) v.begin(), v.end()
#define forn(i, k, n) for(int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
const int INF = 1e9;
//const ll INF = 1e18;
const ll mod = 1000000007;
// const ll mod = 998244353;
void solve(){
ll n;
cin>>n;
string ans="aaa";
if(n>27){
if(n>52){
ans[2] = 'z';
ans[1] = 'z';
ans[0] = (char)('a'+n-53);
}else{
ans[2]='z';
ans[1] = (char)('a'+n-28);
}
}else{
ans[2] = (char)('a'+n-3);
}
forn(i,0,3)cout<<ans[i];
cout<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
cin>>t;
while(t--)
solve();
return 0;
}