Merkkijono

#include<bits/stdc++.h>
#include <iomanip>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O2")
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef vector <string> vs;
typedef pair<int,int> pi;
typedef vector <pair<int,int>> vii;
typedef vector <long long> vll;
 
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
 
#define MP make_pair
#define deb(x) cout << x << " "
#define pb push_back
#define ins insert
#define all(c) c.begin(), c.end()
#define e(n) n%2==0
#define o(n) n%2!=0
#define rep(e,n,a) for(int i=e; i<=n; i+=a)
#define sz(c) (int)c.size()
#define MOD 1000000007
template <typename T> void rd(T& x){cin >> x;}
template<typename H, typename... T> void rd(H& h, T&... t) {
    rd(h);
    rd(t...);
}
template <typename T> void wt(T& x){cout << x;}
 
void print(){cout << "\n";}
 
 
 
void solve(){
    int n; cin >> n ;
    string res,temp;
    string alpha = "abcdefghijklmnopqrstuvwxyz";
    for(int i=0;i<n;i++){
        for(int j = 0;j < sz(res); j++){
            temp.pb(alpha[i]); temp.pb(res[j]);
        }
        res = temp; res += alpha[i];
        temp.clear();
    }
    cout << res << "\n";
}
 
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //freopen("input.txt", "r",stdin);
    //freopen("output.txt", "w", stdout);
 
    int t=1;
    //cin >> t;
    while(t--){
        solve();
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED