提出 #236295

---

ソースコード 拡げる

#include <iostream>
#include <stdio.h>
#include <istream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <complex>
#include <iomanip>


using namespace std;

typedef long long int ll;
typedef unsigned long long ull;
typedef pair<int,int> pi;
typedef pair<long, long> pl;
typedef pair<double, double> pd;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vii;
typedef vector<vl> vll;
typedef vector<double> vec;
typedef vector<vec> mat;
typedef map<int, int> mii;
void dumppi(const pi &p) {  cout << p.first  << ' ' << p.second << endl; }
typedef pair<long, long> pl;
void dumppl(const pl &p) { cout << p.first << ' ' << p.second << endl; }
typedef vector<pi> vpi;
void dumpvpi(const vpi &vec) { for (auto v : vec) { cout << '(' << v.first << ',' << v.second << ')' << ' '; } cout << endl; }
typedef vector<bool> vb;
void dumpvb(const vb &vec) { for (auto b : vec) { cout << b << ' '; } cout << endl; }
typedef vector<int> vi;
void dumpvi(const vi &vec) { for (auto i : vec) { cout << i << ' '; } cout << endl; }
typedef vector<pl> vpl;
void dumpvpi(const vpl &vec) { for (auto v : vec) { cout << '(' << v.first << ',' << v.second << ')' << ' '; } cout << endl; }
typedef vector<vi> vii;
void dumpvii(const vii &mat) {for (auto vec : mat) {for (auto v : vec){cout << v << ' ';} cout << endl;}}


// util macro
// ----------------------------------------
#define mp make_pair
#define pb push_back
//-----------------------------------------

// iterator
// ----------------------------------------
#define all(x) (x).begin(), (x).end()
// ----------------------------------------

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  FOR(i,0,n)
//------------------------------------------

const int INF = 1e9;
const double EPS = 1e-10;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = { 0,-1, 0, 1};

const int mod = 1000000007;
const double g = 9.8;

// POINTS
//-------------------------------------------
typedef complex<double> point;
// X : real();
// Y : imag();
double dot(point a, point b){  // inner product
    return (a * conj(b)).real();
}
double cross(point a, point b){ // outer product
    return (a * conj(b)).imag();
}
double dist(point a, point b) {
    return dot(a-b, a-b);
}
typedef vector<point> vpoint;
//-------------------------------------------

// math
//-------------------------------------------
int gcd(int a, int b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}
ll extgcd(ll a, ll b, ll& x, ll& y) {
    ll d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1; y = 0;
    }
    return d;
}
ll mod_pow(ll x, ll n) {
    if (n==0) return 1;
    ll res = mod_pow(x * x % mod, n / 2);
    if (n & 1) res = res * x % mod;
    return res;
}
ll m_fact(ll n) {
    ll res = 1; for (int i = 2; i <= n; i++) { res = res * i % mod; } return res;
}
ll mod_inverse(ll a) {
    ll x, y;
    extgcd(a, mod, x, y);
    return (mod + x % mod) % mod;
}
ll mod_fact(ll n, ll &e) {
    e = 0;
    if (n == 0) return 1;
    ll res = mod_fact(n / mod, e);
    e += n / mod;
    if (n / mod % 2 != 0) return res * (mod - m_fact(n % mod)) % mod;
    return res * m_fact(n % mod) % mod;
}

ll mod_comb(int n, int k) {
    if (n < 0 || k < 0 || n < k) return 0;
    ll e1, e2, e3;
    ll a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n-k, e3);
    if (e1 + e2 > e3) return 0;
    return a1 * mod_inverse(a2 * a3 % mod);
}
//-------------------------------------------


//-------------------------------------------
// Union Find
class uf {
private:
    vl _par = vl(0);
    vl _rank = vl(0);
public:
    uf(const ll n) {
        _par = vl(n); _rank = vl(n);
        for (ll i = 0; i < n; i++) {
            _par.at(i) = i;
            _rank.at(i) = 0;
        }
    }
    
    ll find(ll x) {
        if (_par.at(x) == x) { return x; }
        else { return _par.at(x) = find(_par.at(x)); }
    }
    
    void unite(ll x, ll y) {
        x = find(x); y = find(y);
        if (x == y) return;
        if (_rank.at(x) < _rank.at(y)) { _par.at(x) = y; }
        else { _par.at(y) = x; if (_rank.at(x) == _rank.at(y)) { _rank.at(x)++; } }
    }
    bool same(ll x, ll y) { return find(x) == find(y); }
};

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


#define  debu 0

int main(int argc, const char * argv[])
{
    ios::sync_with_stdio(false);
    
    ll A, K;
    cin >> A >> K;
    
    if ( A > 100000 ) {
        cout << -1 << endl;
        return 0;
    }
    
    ll ans = A;
    
    for (int i = 0; i <= 299999; i++) {
        stringstream ss;
        ss << i;
        string s = ss.str();
        set<char> chars;
        rep(l, s.size()) {
            chars.insert(s[l]);
        }
        if (chars.size() <= K) {
            ans = min(abs(A-i), ans);
        }
    }
    
    cout << ans << endl;
    
}

提出情報

ジャッジ結果