forked from Krish03na/CS204
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAddition.cpp
50 lines (40 loc) · 852 Bytes
/
Addition.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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <bits/stdc++.h>
using namespace std;
int min(int x,int y){
if(x<y) return x;
else return y;}
int max(int x,int y){
if(x>y) return x;
else return y;}
string SUM(string a, string b){
int l1 = a.length();
int l2 = b.length();
string ans = "";
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
int carry = 0, sum = 0;
for(int i=0; i< min(l1, l2); i++){
sum = (a[i]-'0')+(b[i]-'0') + carry;
ans.push_back(sum%10+'0');
carry = sum/10;
}
for(int j=min(l1, l2); j< max(l1, l2); j++){
if(l2>l1) sum = (b[j]-'0')+carry;
else sum = (a[j]-'0')+carry;
ans.push_back(sum%10+'0');
carry = sum/10;
}
if(carry) ans.push_back(carry+'0');
reverse(ans.begin(), ans.end());
return ans;
}
int main(){
int T;
cin >> T;
while(T--){
string a, b;
cin >> a;
cin >> b;
cout << SUM(a, b) << endl;}
return 0;
}