/* Ajay Jadhav */
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'
void solve()
{
int a, b;
cin >> a >> b;
string word = "ajay";
int distinct_word_count = b / 2;
vector<string> essay;
string conc = "a";
int cnt = 0;
vector<string> strs;
for (int i = 0; i < 26; i++)
{
for (int j = 0; j < 26; j++)
{
for (int k = 0; k < 26; k++)
{
for (int l = 0; l < 26; l++)
{
char fi = (char)(i + 'a');
char se = (char)(j + 'a');
char th = (char)(k + 'a');
char fo = (char)(l + 'a');
string temp;
temp += fi;
temp += se;
temp += th;
temp += fo;
strs.push_back(temp);
}
}
}
}
int index = 0;
rep(i, 0, distinct_word_count)
{
essay.push_back(word + strs[index++]);
}
while (sz(essay) < a)
{
essay.push_back(word);
}
rep(i, 0, sz(essay))
{
cout << essay[i];
if (i < sz(essay) - 1)
cout << " ";
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
{
solve();
}
return 0;
}
Compilation message
esej.cpp: In function 'void solve()':
esej.cpp:45:9: warning: unused variable 'cnt' [-Wunused-variable]
45 | int cnt = 0;
| ^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
15 ms |
16888 KB |
Output is correct |
2 |
Correct |
16 ms |
16864 KB |
Output is correct |
3 |
Correct |
17 ms |
16804 KB |
Output is correct |
4 |
Correct |
15 ms |
16836 KB |
Output is correct |
5 |
Correct |
15 ms |
16836 KB |
Output is correct |
6 |
Correct |
20 ms |
16776 KB |
Output is correct |
7 |
Correct |
18 ms |
18752 KB |
Output is correct |
8 |
Correct |
21 ms |
21824 KB |
Output is correct |
9 |
Correct |
27 ms |
22552 KB |
Output is correct |
10 |
Correct |
19 ms |
18652 KB |
Output is correct |