提出 #11530898

---

ソースコード 拡げる

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
//using namespace __gnu_pbds;
//typedef tree< pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>
//ordered_set;
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
#define X first
#define Y second
#define int long long int 
const int N = (int)1e6 + 10;
const int MOD = 1000000007;


void solve(){
    int k; cin >> k;
    vector<string> a(k + 100);
    for(int i = 1; i <= 9; ++i){
        string n = to_string(i);
        a[i] = n;
    }
    int id = 10;
    int from = 1;
    while(id <= k ){
        int lastch = a[from][a[from].size() - 1] - '0';
        int mn = max(lastch - 1,(int)0);
        int mnm = lastch;
        int mnu = min((int)9, lastch + 1);
        if( lastch == 0 ){
            a[id++] = a[from] + (char)(mnm + '0');
            a[id++] = a[from] + (char)(mnu + '0');
        } else if( lastch == 9){
            a[id++] = a[from] + (char)(mn + '0');
            a[id++] = a[from] + (char)(mnm + '0');
        } else {
            a[id++] = a[from] + (char)(mn + '0');
            a[id++] = a[from] + (char)(mnm + '0');
            a[id++] = a[from] + (char)(mnu + '0');
        }
      	if(id > k) break;
        from++;
    }
    cout << a[k] << '\n';


}   

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr); 
    //int t; cin >> t;
    //while(t--)
        solve();
    return 0;
}

提出情報

ジャッジ結果