Submission #499387

Source Code Expand

#include <iostream>
#include<vector>
#include <utility>
#include <string>
#include<algorithm>

using namespace std;

//int main(int argc, const char * argv[]) {
//   
//    int count=0;
//    for (int i = 0; i<12; i++) {
//        string data = "";
//        cin>>data;
//       
//        if(data.find("r")!=string::npos){
//                count++;
//            }
//    }
//    cout<<count<<endl;
//    return 0;
//}
char indexof[3] ={'a','b','c'};
int countdara=0;
void rec(int node,int ix,string io){
    if (node == countdara) {
        cout<<io<<endl;
        return;
    }else{
        
        rec(1+node, 0,io+indexof[ix]);
        rec(1+node, 1,io+indexof[ix]);
        rec(1+node, 2,io+indexof[ix]);
    }
}

int main(int argc, const char * argv[]) {
    
    
    cin>>countdara;
    rec(0,0,"");
    rec(0,1,"");
    rec(0,2,"");
    
    return 0;
}

Submission Info

Submission Time
Task C - Brute-force Attack
User taketan
Language C++ (GCC 4.9.2)
Score 0
Code Size 911 Byte
Status WA
Exec Time 86 ms
Memory 928 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 2
WA × 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 WA 28 ms 928 KiB
subtask0_sample_02.txt WA 25 ms 924 KiB
subtask1_01.txt WA 28 ms 800 KiB
subtask1_02.txt WA 28 ms 796 KiB
subtask1_03.txt WA 28 ms 924 KiB
subtask1_04.txt WA 35 ms 920 KiB
subtask1_05.txt WA 47 ms 804 KiB
subtask1_06.txt WA 86 ms 804 KiB