Submission #305603
Source Code Expand
#include <iostream> #include <cstdlib> #include <cstdio> #include <cmath> #include <cstring> #include <algorithm> using namespace std; int a[10]; void dfs(int k ,int n){ if(k == n +1){ for(int k = 1; k <= n; k++) printf("%d", a[k]); puts(""); }else { for(int i = 0; i <= 9; i++){ a[k] = i; dfs(k+1, n); } } } int main(){ // freopen("a.in", "r", stdin); //freopen("a.out", "w", stdout); int n; while(~scanf("%d", &n)){ int s = 1; for(int i = 1; i <= n; i++)s *= 10; printf("%d\n", s-1); dfs(1, n); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Lock |
User | asian-2014-1993 |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 704 Byte |
Status | WA |
Exec Time | 96 ms |
Memory | 804 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 | 792 KB |
subtask0_sample_02.txt | WA | 24 ms | 796 KB |
subtask1_01.txt | WA | 22 ms | 800 KB |
subtask1_02.txt | WA | 31 ms | 804 KB |
subtask1_03.txt | WA | 96 ms | 672 KB |