Submission #1691734
Source Code Expand
#include <bits/stdc++.h> #define REP(i,a,b) for(int i=(a);i<(b);i++) #define RREP(i,a,b) for(int i=(a);i>=(b);i--) typedef long long ll; typedef long double ld; using namespace std; const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,0,-1,1,0,0}; const ld PI=abs(acos(-1)); int n; bool used[10][3]={}; string s; set<string> st; int dfs(char c,int d){ if(used[d][c-'a']) return 0; if(d==n){st.insert(s); return 0;} used[d][c]=true; for(char i='a';i<'d';i++){ s+=i; dfs(i,d+1); s.pop_back(); } used[d][c]=false; return 0; } int main(){ cin >> n; for(char i='a';i<'d';i++){ s=i; dfs(i,1); } for(auto w:st) cout << w << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Brute-force Attack |
User | ecasdqina |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 704 Byte |
Status | AC |
Exec Time | 14 ms |
Memory | 896 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 2 ms | 256 KB |
subtask1_04.txt | AC | 2 ms | 256 KB |
subtask1_05.txt | AC | 5 ms | 512 KB |
subtask1_06.txt | AC | 14 ms | 896 KB |