/* 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;
rep(i, 0, distinct_word_count)
{
essay.push_back(word + to_string(i));
}
while (sz(essay) < a)
{
essay.push_back(word);
}
rep(i, 0, sz(essay))
{
cout << essay[i] << " ";
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
{
solve();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
324 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
600 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
984 KB |
Output isn't correct |
7 |
Incorrect |
5 ms |
2512 KB |
Output isn't correct |
8 |
Incorrect |
7 ms |
4520 KB |
Output isn't correct |
9 |
Incorrect |
8 ms |
4556 KB |
Output isn't correct |
10 |
Incorrect |
4 ms |
2512 KB |
Output isn't correct |