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

#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <numeric>
#include <ctime>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
using ll = long long;
const ll N=1e6+5,mod=1e9+7,inf=0x3f3f3f3f;


void solve(){
    string a,b;
    cin>>a;
    b=a;
    reverse(a.begin(),a.end());
    int x=stoi(a),y=stoi(b);
    cout<<x+y<<'\n';
}

int main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int t=1;
    //cin>>t;

    while(t--){
        
        solve();

    }
 
    return 0;
}