Submission #305586
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; int main(){ ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> digits(n); vector<int> dir(n); int m = 1; for(int i = 0; i < n; ++i){ m *= 10; } cout << m - 1 << endl; for(int i = 0; i < m; ++i){ for(int j = 0; j < n; ++j){ cout << digits[j]; } cout << endl; for(int i = n - 1; i >= 0; --i){ if(dir[i] == 0){ if(digits[i] == 9){ dir[i] = 1; }else{ ++digits[i]; break; } }else{ if(digits[i] == 0){ dir[i] = 0; }else{ --digits[i]; break; } } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Lock |
User | logicmachine |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 688 Byte |
Status | AC |
Exec Time | 276 ms |
Memory | 928 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 23 ms | 924 KB |
subtask0_sample_02.txt | AC | 22 ms | 800 KB |
subtask1_01.txt | AC | 27 ms | 804 KB |
subtask1_02.txt | AC | 50 ms | 928 KB |
subtask1_03.txt | AC | 276 ms | 924 KB |