forked from krnbatra/SPOJ-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathADDREV.cpp
35 lines (31 loc) · 774 Bytes
/
ADDREV.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
/*My First Template :D*/
#include <bits/stdc++.h>
using namespace std;
#define MOD (int)1e9+7
#define ll long long
#define pb push_back
template <typename T> T mod(T a, T b){return (a%b>0)?(a%b):mod((a+b),b);}
template <typename T> T gcd(T a, T b){return (b==0)?a:gcd(b,a%b);}
template <typename T> T lcm(T a, T b){return a*(b/gcd(a,b));}
template <typename T> T exp(T b, T p, T m){T x = 1;while(p){if(p&1)x=mod((x*b),m);b=mod((b*b),m);p=p>>1;}return x;} //use only for unsigned numbers
int reverse(int n){
int res = 0;
while(n){
res = res*10+(n%10);
n/=10;
}
return res;
}
int main(){
int T;
cin>>T;
while(T--){
int a, b;
cin>>a>>b;
int rev_a = reverse(a);
int rev_b = reverse(b);
int ans = rev_a+rev_b;
cout<<reverse(ans)<<endl;
}
return 0;
}