Submission #48581596

---

Source Code Expand

//#pragma omp parallel for num_threads(64)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize(2,3,"Ofast","inline","-fgcse","-fgcse-lm","-fipa-sra","-ftree-pre","-ftree-vrp","-fpeephole2","-ffast-math","-fsched-spec","unroll-loops","-falign-jumps","-falign-loops","-falign-labels","-fdevirtualize","-fcaller-saves","-fcrossjumping","-fthread-jumps","-funroll-loops","-freorder-blocks","-fschedule-insns","inline-functions","-ftree-tail-merge","-fschedule-insns2","-fstrict-aliasing","-falign-functions","-fcse-follow-jumps","-fsched-interblock","-fpartial-inlining","no-stack-protector","-freorder-functions","-findirect-inlining","-fhoist-adjacent-loads","-frerun-cse-after-loop","inline-small-functions","-finline-small-functions","-ftree-switch-conversion","-foptimize-sibling-calls","-fexpensive-optimizations","inline-functions-called-once","-fdelete-null-pointer-checks")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
//#pragma comment(linker,"/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//--------------------------------------------------------神奇加速

#include<bits/stdc++.h>
//#include<windows.h>

//--------------------------------------------------------

#define ll long long
//#define int unsigned long long
#define i128 __int128
#define ull unsigned long long
#define pii pair<int,int>
#define fir first
#define se second
#define endl '\n'
#define debug1 puts("AK IOI -- part 1")
#define debug2 puts("AK IOI -- part 2")
#define debug3 puts("AK IOI -- part 3")
#define debug4 puts("AK IOI -- part 4")
#define re register
#define Yes puts("Yes")
#define No puts("No")
#define YES puts("YES")
#define NO puts("NO")
#define yes puts("yes")
#define no puts("no")
#define error puts("error")
#define IMPOSSIBLE puts("IMPOSSIBLE")
#define Impossible puts("Impossible")
#define fy puts("-1")
#define pll pair<long long, long long>
#define AC exit(0)
//
////-------------------------------------------------------define好习惯
//
using namespace std;
//-------------------------------------------------------主程序-----------------------------------------------------
#define int long long
const int N = 500;
int a[20]= {0,1,11,111,1111,11111,111111,1111111,11111111,111111111,1111111111,11111111111,11111111111,111111111111};
int n;
map<int,int> mp;
vector<int > ve;
int b[5];
void dfs(int x){
	if (x == 4){
		int cnt = 0;
		for (int i = 1; i <= 3; i++) cnt += a[b[i]];
		if (!mp[cnt]) ve.push_back(cnt);
		mp[cnt] = 1;
		return ;
	}	
	for (int i = 1; i <= 13; i++){
		b[x] = i;
		dfs(x + 1);
	}
}
void solve(){
	cin >> n;
	dfs(1);
	sort(ve.begin(),ve.end());
	cout<<ve[n-1];
}

signed main(){
//	freopen("std.in","r",stdin);
//	freopen("std.out","w",stdout);
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int TTT=1;
//	cin >> TTT;
	while(TTT--){
		solve();
	}
	return 0;
}

Submission Info

Judge Result