Submission #74529396

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vec vector
#define pll pair<ll,ll>
const ll N = 1e5 + 10;
const ll mod = 1e9 + 7;

ll b[40],c[40];
vec<ll> a;

void dfs(ll x){
	if(x > 1e9) return ;
	a.push_back(x);
	for(int i = 0 ; i <= 32 ; i++){
		dfs(x * c[i] + b[i]);
	}
}

void solve(){
	ll n;cin >> n;
	b[0] = 1;
	for(int i = 1 ; i <= 32 ; i++){
		b[i] = b[i - 1] * 2;
	}
	for(int i = 0 ; i <= 32 ; i++){
		ll v = b[i];
		c[i] = 1;
		while(v > 0){
			v /= 10;
			c[i] *= 10;
		}
	}
	dfs(0);
	sort(a.begin(),a.end());
	a.erase(unique(a.begin(),a.end()),a.end());
	cout << a[n] << "\n";
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
	int T = 1;
//  	cin >> T;
	while(T--){
		solve();
	}
    return 0;
}

Submission Info

Judge Result