-
Notifications
You must be signed in to change notification settings - Fork 0
/
b10757.cpp
85 lines (78 loc) · 1.26 KB
/
b10757.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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
string a, b;
int main(void) {
cin >> a >> b;
vector<char> out;
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
int min_length;
bool a_is_small = false;
if(a.size() < b.size()) {
a_is_small = true;
min_length = a.size();
}
else {
a_is_small = false;
min_length = b.size();
}
bool carry = false;
for(int i=0;i<min_length;++i) {
int op1 = int(a[i] - '0');
int op2 = int(b[i] - '0');
int op3 = op1 + op2;
if(carry == true) {
op3++;
}
if(op3 > 9) {
carry = true;
op3-=10;
}
else{
carry = false;
}
out.push_back(op3 + '0');
}
if(a_is_small) {
for(int i = min_length; i<b.size();++i) {
int op3 = int(b[i] - '0');
if(carry) {
carry = false;
op3++;
}
if(op3 > 9) {
carry = true;
op3 -= 10;
}
else {
carry = false;
}
out.push_back(op3 + '0');
}
}
else {
for(int i = min_length; i<a.size();++i) {
int op3 = int(a[i] - '0');
if(carry) {
carry = false;
op3++;
}
if(op3 > 9) {
carry = true;
op3 -= 10;
}
else {
carry = false;
}
out.push_back(op3 + '0');
}
}
if(carry){
out.push_back('1');
}
for(int i=out.size()-1;i>=0;i--) {
cout << out[i];
}
}