Submission #823256

#TimeUsernameProblemLanguageResultExecution timeMemory
823256ajayEsej (COCI15_esej)C++14
24 / 80
98 ms65536 KiB
/* 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; rep(i, 0, distinct_word_count) { essay.push_back(word + conc); cnt++; if (cnt == 26) { conc += 'a'; cnt %= 26; } else { conc[sz(conc) - 1] += 1; } } 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; }
#Verdict Execution timeMemoryGrader output
Fetching results...