Submission #1781481

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
vector<string>rec(int n){
	if(n == 1){
		vector<string>ret;
		rep(i,10){
			string str = "";
			str.pb('0'+i);
			ret.pb(str);
		}
		return ret;
	}
	vector<string>x = rec(n-1);
	vector<string>ret;
	for(int i=0;i<10;i++){
		char ch = '0'+i; string S = ""; S.pb(ch);
		rep(j,x.size()) ret.pb(x[j]+S);
		reverse(x.begin(),x.end());
	}
	return ret;
}
int main(){
	int n; cin>>n;
	int x=1;
	rep(i,n) x *= 10;
	cout<<x-1<<endl;
	vector<string>vec = rec(n);
	rep(i,vec.size()) cout<<vec[i]<<endl;
}

Submission Info

Judge Result