MCLONUM - Closest Number

Tác giả: happyboy99x

Ngôn ngữ: C++

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define sz(a) int((a).size())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(), _e = (c).end(); i != _e; ++i)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define rep(i,n) for(int i = 0, _n = (n); i < _n; ++i)
#define repd(i,n) for(int i = (n)-1; i >= 0; --i )
#define fo(i,a,b) for(int i = (a), _b = (b); i <= _b; ++i)
#define fod(i,a,b) for(int i = (a), _b = (b); i >= _b; --i)

#define INF 1000000000
#define N 65

char a[N], b[N], c[N]; int n, cnt[256]; bool finished;

void init() {
	memset(cnt,0,sizeof cnt);
	memset(c,0,sizeof c);
	rep(i,n) ++cnt[b[i]];
	finished = 0;
}

void find1(int i, bool check) {
	if(i == n) {
		if(strcmp(c,a) >= 0) {
			puts(c); finished = 1;
		}
	} else {
		if(check) {
			fo(j,0x30,0x39) if(cnt[j]) {
				--cnt[j]; c[i] = j;
				find1(i+1, 1); if(finished) return;
				++cnt[j]; break;
			}
		} else {
			fo(j,a[i],0x39) if(cnt[j]) {
				--cnt[j]; c[i] = j;
				find1(i+1, j > a[i]);
				if(finished) return; ++cnt[j];
			}
		}
	}
}

void find2(int i, bool check) {
	if(i == n) {
		if(strcmp(c,a) < 0) {
			puts(c); finished = 1;
		}
	} else {
		if(check) {
			fod(j,0x39,0x30) if(cnt[j]) {
				--cnt[j]; c[i] = j;
				find2(i+1,1); if(finished) return;
				++cnt[j]; break;
			}
		} else {
			fod(j,a[i],i ? 0x30 : 0x31) if(cnt[j]) {
				--cnt[j]; c[i] = j;
				find2(i+1, j < a[i]);
				if(finished) return; ++cnt[j];
			}
		}
	}
}

int main() {
#ifndef ONLINE_JUDGE
	freopen( "input.txt", "r", stdin );
#endif
	scanf("%s%s",a,b); n = strlen(a);
	init(); find1(0, 0); if(!finished) puts("0");
	init(); find2(0, 0); if(!finished) puts("0");
	return 0;
}

Download