Submission #21682539

---

Source Code Expand

# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# define int long long
# define fi first
# define se second

using namespace std;

const int N = 1e5 + 7;

int mp[N];

int32_t main() {
    string s1, s2, s3, no = "UNSOLVABLE";
    cin >> s1 >> s2 >> s3;
    int n = s1.size(), m = s2.size(), k = s3.size();
    if ( k != max( { n, m, k } ) ) {
        cout << no;
        return 0;
    }
    set < char > st;
    for ( auto i: s1 ) {
        st.insert(i);
    }
    for ( auto i: s2 ) {
        st.insert(i);
    }
    for ( auto i: s3 ) {
        st.insert(i);
    }
    if ( st.size() > 10 ) {
        cout << no;
        return 0;
    }
    vector < char > vc;
    for ( auto i: st ) {
        vc.push_back(i);
    }
    int sz = vc.size();
    vector < int > v;
    for ( int i = 0; i < 10; i++ ) {
        v.push_back(i);
    }
    do {
        for ( int i = 0; i < sz; i++ ) {
            mp[ vc[i] + 0 ] = v[i];
        }
        int a = 0, b = 0, c = 0, ok = 1;
        for ( int i = 0; i < n; i++ ) {
            a *= 10;
            a += mp[ s1[i] + 0 ];
            if ( a == 0 ) {
                ok = 0;
                break;
            }
        }
        for ( int i = 0; i < m; i++ ) {
            b *= 10;
            b += mp[ s2[i] + 0 ];
            if ( b == 0 ) {
                ok = 0;
                break;
            }
        }
        for ( int i = 0; i < k; i++ ) {
            c *= 10;
            c += mp[ s3[i] + 0 ];
            if ( c == 0 ) {
                ok = 0;
                break;
            }
        }
        if ( a + b == c && a > 0 && b > 0 && c > 0 && ok ) {
            cout << a << '\n' << b << "\n" << c;
            return 0;
        }
    }
    while ( next_permutation(v.begin(), v.end()) );
    cout << no;
}
    

Submission Info

Judge Result