#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;
using ld = long double;
const int N = int(1e6) + 500;
int A, B;
queue <string> q;
vector <string> res;
int main() {
fast_io;
cin >> A >> B;
A = max(A, B / 2);
q.push("");
while (int(res.size()) < A) {
string t = q.front();
q.pop();
for (int i = 0; i < 26; ++i) {
res.push_back(t + char(i + 'a'));
q.push(t + char(i + 'a'));
}
}
cout << res[0];
for (int i = 1; i < min(B, int(res.size())); ++i)
cout << " " << res[i];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
768 KB |
Output is correct |
6 |
Correct |
3 ms |
1152 KB |
Output is correct |
7 |
Correct |
8 ms |
3700 KB |
Output is correct |
8 |
Correct |
13 ms |
6648 KB |
Output is correct |
9 |
Correct |
15 ms |
7188 KB |
Output is correct |
10 |
Correct |
12 ms |
3700 KB |
Output is correct |