提出 #577261

---

ソースコード 拡げる

#include<bits/stdc++.h>

#define REP(i,n) for(int i = 0;i<(int) (n);i++)
#define ALL(x) (x).begin(),(x).end()
using namespace std;

typedef long long ll;
ll s2l(string S) {
  ll res = 0;
  int n = S.length();
  REP(i,n) {
    res *= 10;
    res += S[i] - '0';
  }
  return res;
}

ll eval(string S, string K) {
  int n = S.length();
  ll s = s2l(S), k = s2l(K);
  ll base = 1;
  REP(i,n) base *= 10;
  return min(abs(s - k), base - abs(s - k));
}

int main(){
  string S;
  cin >> S;
  int n = S.length();
  string T = "0123456789";
  string res = "*";
  do{
    string tmp = T.substr(0, n);
    if(res == "*") {
      res = tmp;
    }else {
      ll resdist = eval(S, res);
      ll tmpdist = eval(S, tmp);
      if(resdist < tmpdist) {
        res = tmp;
      }else if(resdist == tmpdist) {
        if(s2l(res) > s2l(tmp)) res = tmp;
      }
    }
  }while(next_permutation(T.begin(), T.end()));
  
  cout << res << endl;
}

提出情報

ジャッジ結果