提出 #577422

---

ソースコード 拡げる

#include<vector>
#include<iostream>
#include<map>
#include<algorithm>
#include<set>
#include<queue>
#include<cassert>
#include<cstring>
#include<cstdio>
#include<cstdlib>

using namespace std;
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define REPS(i, n) for(int i=1;i<=(int)n;i++)
#define RREP(i, n) for(int i=n-1;i>=0;i--)
#define RREPS(i, n) for(int i=n;i>0;i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int INF = 1<<29;	

int n;
ll old_, m, ans;
bool used[16];

void dfs(int depth, ll a) {
	if(depth == n) {
		if(min(abs(old_ - ans), m - abs(old_ - ans)) <  
		   min(abs(old_ - a),  m - abs(old_ - a))) {
			ans = a;
		}
		return;
	}
	for(int i = 0; i < 10; i++) {
		if(!used[i]) {
			used[i] = true;
			dfs(depth+1, a * 10 + i);
			used[i] = false;
		}
	}
}

int main() {
	string s;
	cin >> s;
	n = s.size();
	m = 1;
	REP(i, n) {
		m *= 10;
	}
	//old_ = stoi(s);
	old_ = 0;
	REP(i, n) {
		old_ = old_ * 10 + (s[i] - '0');
	}
	//cout << old_ << endl;
	ans = old_;
	dfs(0, 0);
	//string tmp = to_string((ll)ans);
	string tmp(n, '0');
	REP(i, n) {
		tmp[i] = '0' + (ans % 10);
		ans /= 10;
	}
	reverse(ALL(tmp));
	cout << tmp << endl;
	//REP(i, n-tmp.size()) cout << 0;
	//cout << ans << endl;
	return 0;
}

提出情報

ジャッジ結果