题解 | 数字反转

#include <iostream>
#include <vector>

using namespace std;

int re(int n) {
    vector<int> num;
    while (n > 0) {
        int x = n % 10;
        n = n / 10;
        num.push_back(x);
    }
    int sum = 0;
    for (int a : num) {
        sum = sum * 10 + a;
    }
    return sum;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int a, b;
    while (cin >> a >> b) {
        int sum = a + b;
        int sum_s = re(sum);
        int a_s = re(a);
        int b_s = re(b);
        int s_sum = a_s + b_s;
        if (sum_s == s_sum) cout << sum << "\n";
        else cout << "NO" << "\n";
    }
    return 0;
}