Submission #551625


Source Code Expand

#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <list>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <iterator> 

#define REP(i,n) for (int i=0;i<(n);i++)

using namespace std;

void print_pass(int N) {
    int count[N];
    string abc = "abc";
    REP(i, N) count[i] = 0;
    while (true) {
        REP(i, N) {
            cout << abc[count[N-i-1]];
        }
        cout << endl;
        count[0] += 1;
        for (int i = 1; i < N; i++) {
            if (count[i-1] == 3) {
                count[i-1] = 0;
                count[i] += 1;
            }
        }
        if (count[N-1] == 3) {
            break;
        }
    }
}

int main(int argc, char const* argv[])
{
    int N;
    cin >> N;
    print_pass(N);
    return 0;
}

Submission Info

Submission Time
Task C - Brute-force Attack
User sz_dr
Language C++11 (GCC 4.9.2)
Score 100
Code Size 981 Byte
Status AC
Exec Time 47 ms
Memory 928 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 8
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 25 ms 796 KiB
subtask0_sample_02.txt AC 25 ms 800 KiB
subtask1_01.txt AC 26 ms 924 KiB
subtask1_02.txt AC 27 ms 920 KiB
subtask1_03.txt AC 27 ms 916 KiB
subtask1_04.txt AC 30 ms 796 KiB
subtask1_05.txt AC 35 ms 792 KiB
subtask1_06.txt AC 47 ms 928 KiB