Submission #305589
Source Code Expand
#include <iostream> #include <algorithm> #include <string> #include <cstring> using namespace std; void dfs(int n,string k){ if(n==0){ cout << endl; return; } for(int i=0;i<10;i++){ if(n==1) cout << k+char(i+'0'); dfs(n-1,k+char(i+'0')); } } int main() { int n; cin >> n; for(int i=0;i<n;i++) cout << 9; cout << endl; dfs(n,""); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Lock |
User | asian-2014-3573 |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 383 Byte |
Status | WA |
Exec Time | 280 ms |
Memory | 924 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 22 ms | 796 KB |
subtask0_sample_02.txt | WA | 23 ms | 924 KB |
subtask1_01.txt | WA | 25 ms | 804 KB |
subtask1_02.txt | WA | 49 ms | 808 KB |
subtask1_03.txt | WA | 280 ms | 804 KB |