题解 | #23年OPPO-a的翻转#

直接按题意模拟即可。

#include<bits/stdc++.h>
#define int long long
#define double long double
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 3e5 + 10;
const int M = 1e3 + 10;
int mod = 1e9 + 7;
int a[N];
int cal(string s) {
    int ans = 0;
    for (int i = 0; i < s.size(); i++) ans = ans * 10 + s[i] - '0';
    return ans;
}

void solve() {
    string s;
    cin >> s;
    string t = s;
    reverse(t.begin(), t.end());
    // cout<<cal(s)<<"\n";
    cout << cal(s) + cal(t) << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int _;
    _ = 1;
    //cin>>_;
    while (_--) {
        solve();
    }
}