回文数__

// Problem: Captcha Cracker
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/20960/1007
// Memory Limit: 524288 MB
// Time Limit: 2000 ms
// 2022-03-27 02:18:39
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
int cnt[10];
void solve() {
	int f = 0, sum = 0, num = -1;
	for (int i = 0; i <= 9; i ++) {
		cin >> cnt[i];
		sum += cnt[i];
		if (cnt[i] % 2) {
			f ++;
			num = i;
		}
	}
	if (f > 1) {
		puts("-1");
		return;
	}
	if (cnt[0] == 1 && cnt[0] == sum) {
		cout << 0 << endl;
		return;
	}
	else if (cnt[0] == sum) {
		puts("-1");
		return;
	}
	if (!cnt[0]) {
		string ans = "";
		for (int i = 1; i <= 9; i ++) {
			for (int j = 1; j <= cnt[i] / 2; j ++)
				ans += to_string(i);
		}
		if (sum % 2 == 0) {
			if (f) {
				puts("-1");
				return;
			}
			string temp = ans;
			reverse(all(temp));
			ans += temp;
			cout << ans << endl;
		}
		else {
			string temp = ans;
			reverse(all(temp));
			ans += temp;
			if (f) {
				ans.insert(ans.size() / 2, to_string(num));
			}
			cout << ans << endl;
		}
	} 
	else {
		string ans = "";
		int c = -1;
		for (int i = 1; i <= 9; i ++) if (cnt[i] > 1) {
			c = i;
			break;
		}
		if (c == -1) {
			puts("-1");
			return;
		}
		ans += to_string(c);
		cnt[c] -= 2;
		for (int i = 1; i <= cnt[0] / 2; i ++)
			ans += to_string(0);
		for (int i = 1; i <= 9; i ++)
			for (int j = 1; j <= cnt[i] / 2; j ++)
				ans += to_string(i);
				
		if (sum % 2 == 0) {
			if (f)  {
				puts("-1");
				return;
			}
			string temp = ans;
			reverse(all(temp));
			ans += temp;
			cout << ans << endl;
		}
		else {
			string temp = ans;
			reverse(all(temp));
			ans += temp;
			ans.insert(ans.size()/2, to_string(num));
			cout << ans << endl;
		}
	}
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

硬模拟:贪心策略对于有0和没0的情况分开讨论 11022011错的，应该是10122101