Submission #6898668

---

Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <csignal>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>

using ll = long long;
using namespace std;

void dfs(string ans, int cur, int n) {
    if (cur == n) {
        cout << ans << endl;
    }
    else {
        dfs(ans+'a', cur+1, n);
        dfs(ans+'b', cur+1, n);
        dfs(ans+'c', cur+1, n);
    }
}

int main() {
    int n = 0;
    cin >> n;
    dfs("", 0, n);
    return 0;
}

Submission Info

Judge Result