Submission #577737

---

Source Code Expand

#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <sstream>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define int ll

int to_i(const string &s) {
    int ret;
    stringstream ss;
    ss<<s;
    ss>>ret;
    return ret;
}

string in,ans;

int f(string &s) {
    int t1=to_i(in);
    int t2=to_i(s);
    int p=pow(10.0,in.size());
    int t=min(abs(t1-t2),p-abs(t1-t2));

    return t;
}

void update(string &s) {
    if(ans=="") {
        ans=s;
        return;
    }
    int t1=f(s);
    int t2=f(ans);
    if(t2<t1) ans=s;
}

void dfs(string s,int S) {
    if(s.size()==in.size()) {
        update(s);
    }
    rep(i,10) {
        if(S>>i&1) continue;
        dfs(s+string(1,i+'0'),S|1<<i);
    }
}

signed main() {
    cin>>in;
    string s;
    int t=in[0]-'0';
    if(t<5) {
        t+=5;
    }
    else {
        t-=5;
    }
    s+=string(1,t+'0');
    dfs(s,1<<t);
    s="";
    t=in[0]-'0';
    if(t<6) {
        t+=4;
    }
    else {
        t-=6;
    }
    s+=string(1,t+'0');
    dfs(s,1<<t);
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result