-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA_Common_Prefixes.cpp
More file actions
95 lines (86 loc) · 1.7 KB
/
A_Common_Prefixes.cpp
File metadata and controls
95 lines (86 loc) · 1.7 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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <bits/stdc++.h>
using namespace std;
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b) / gcd(a, b)
#define GOLD ((1 + sqrt(5)) / 2)
const double PI = 3.14159265358979323846264338327950288419716939937510582097494459230;
void swaps(char *x, char *y)
{
char temp;
temp = *x;
*x = *y;
*y = temp;
}
void swapi(int *a, int *b)
{
int temp;
temp = *a;
*a = *b;
*b = temp;
}
void preprocess()
{
} //end prepreprocess
void refresh()
{
} //end refresh
void compute()
{
int n;
cin >> n;
vector<int> a(n);
vector<string> s(n + 1);
char ch;
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
ch = 'a';
s[0] += 'a';
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < min(s[i].length(), a[i]); ++j)
{
s[i + 1] += s[i][j];
}
for (int j = s[i].length(); j < a[i]; ++j)
{
s[i] += ch;
s[i + 1] += ch;
}
++ch;
if (ch > 'z')
{
ch = 'a';
}
if (s[i + 1].length() == 0)
{
s[i + 1] += ((s[i][a[i]] + 1) > 'z' ? 'a' : 'z');
}
}
for (int i = 0; i < n + 1; ++i)
{
cout << s[i] << "\n";
}
} //end compute
int main()
{
#ifdef debug
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("log.txt", "w", stderr);
#endif
int t, i, j;
preprocess();
scanf("%d", &t);
while (t--)
{
compute();
} //end while
#ifdef debug
fprintf(stdout, "\nTIME: %.3lf sec\n", (double)clock() / (CLOCKS_PER_SEC));
#endif
return 0;
} //end main*