Submission #1674631

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;

int bitnum(int n){
    int ret = 0;
    while(n > 0){
        ret += (n & 1); n >>= 1;
    }
    return ret;
}

int change_to_i(string s){
   stringstream ss; int k;
   ss<<s; ss>>k;
   return k;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int k;
    string s;
    cin >> k >> s;
    int l = s.size();
    int ans = 1e18;
    for(int mask = 0; mask < (1LL << (l - 1)); mask++){
        if(bitnum(mask) != k) continue;
        int MAX = 0;
        int now = 0;
        // cout << s << endl;
        // mask += (1LL << (l - 1));
        for(int i = 0; i < l; i++){
            if(mask & (1LL << i)){
                string tmp = s.substr(now, i - now + 1);
                now = i + 1;
                // cout << i << ": " << tmp << " ";
                int num = change_to_i(tmp);
                chmax(MAX, num);
            }
        }
        string tmp = s.substr(now, s.size() - now);
        int num = change_to_i(tmp);
        chmax(MAX, num);
        // cout << endl;
        chmin(ans, MAX);
    }
    cout << ans << endl;
}

Submission Info

Judge Result