Submission #6779547

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll mod = 1000000007;

int n;
int x[8];

void printABC() {
    rep(i, n) {
        if(x[i] == 0) {
            cout << 'a';
        }
        else if(x[i] == 1) {
            cout << 'b';
        }
        else if(x[i] == 2) {
            cout << 'c';
        }
    }

    cout << "\n";
}

void dfs(int pos) {
    if(pos == n) {
        printABC();
        return;
    }

    x[pos] = 0; dfs(pos+1);
    x[pos] = 1; dfs(pos+1);
    x[pos] = 2; dfs(pos+1);
}

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

Submission Info

Judge Result