Submission #305584
Source Code Expand
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL))
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
const int MX = 100005, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1}; //^<v>
void nx(char& c) {
if (c == '9') c = '0';
else c++;
}
void dfs(int n, string& s) {
if (n == 0) {
cout << s << endl;
return;
}
n--;
dfs(n,s);
rep(i,9) {
nx(s[n]);
dfs(n,s);
}
}
int main(){
int n;
cin >> n;
string s(n,'0');
int m = 1;
rep(i,n) m *= n;
cout << m-1 << endl;
dfs(n,s);
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Lock |
User |
snuke |
Language |
C++11 (GCC 4.8.1) |
Score |
0 |
Code Size |
1452 Byte |
Status |
WA |
Exec Time |
301 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 |
WA |
25 ms |
804 KB |
subtask0_sample_02.txt |
WA |
26 ms |
672 KB |
subtask1_01.txt |
WA |
31 ms |
800 KB |
subtask1_02.txt |
WA |
55 ms |
800 KB |
subtask1_03.txt |
WA |
301 ms |
924 KB |