Untitled

mail@pastecode.io avatar
unknown
c_cpp
7 months ago
1.2 kB
5
Indexable
Never
#include "bits/stdc++.h"
// @JASPER'S BOILERPLATE
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define FORD(i, a, b) for(int i = a; i >= b; i--)
#define REP(i, b) for(int i = 0; i < b; i++)
#define PER(i, b) for(int i = b - 1; i >= 0; i--)
#define fi first
#define se second
#ifdef JASPER2
#include "debug.h"
#else
#define debug(...) 166
#endif

using pii = pair < int, int >;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int N = 1e2 + 5;

ll a, b;

ll maximized(ll x) {
    string X = to_string(x);
    for (int i = 0; i < X.size(); ++i)
        if (X[i] == '5')
            X[i] = '6';
    return stoll(X);
}

ll minimized(ll x) {
    string X = to_string(x);
    for (int i = 0; i < X.size(); ++i)
        if (X[i] == '6')
            X[i] = '5';
    return stoll(X); 
}

void run_case() {
    cin >> a >> b;
    cout << maximized(a) + maximized(b) << " ";
    cout << minimized(a) + minimized(b) << "\n";
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    #ifdef JASPER2
        freopen("in1", "r", stdin);
    #endif

    int Test = 1;
    //cin >> Test;
    for (int test = 1; test <= Test; test++){

        run_case();
    }
}