Submission #7091262

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for(int i=0; i<n; i++)

int main(){

    int n; cin >> n;

    int N = pow(3, n);

    int a[n] = {};
    for(int i=0; i<N; i++){
        for(int i=n-1; i>=0; i--){
            if(a[i] == 0){
                cout << 'a';
            }
            else if(a[i] == 1){
                cout << 'b';
            }
            else{
                cout << 'c';
            }
        }
        cout << endl;
        a[0]++;
        for(int i=0; i<n-1; i++){
            if(a[i] == 3){
                a[i] = 0;
                a[i+1]++;
            }
        }
    }



    return 0;
}

Submission Info

Judge Result