Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- #include <string>
- #include <algorithm>
- #include <vector>
- using namespace std;
- vector<long long> sumV( vector<long long> a, vector<long long> b ) {
- bool f1 = false;
- if (a.size() < b.size()) {
- swap(a, b);
- f1 = true;
- }
- /*for (int i = a.size()-1; i < k; ++i) {
- a.push_back(0);
- }
- for (int i = b.size()-1; i < k; ++i) {
- b.push_back(0);
- }*/
- vector<long long> r;
- for (long long i = 0; i < a.size(); ++i) {
- r.push_back(0);
- }
- for (long long i = 0; i < a.size(); ++i) {
- if (i+ b.size() - a.size() < 0) {
- r[i] += a[i];
- } else {
- r[i] += a[i] + b[i+ b.size() - a.size()];
- if (r[i] > 9 && i < a.size()-1) {
- r[i] -= 10;
- r[i-1]++;
- }
- }
- }
- if (f1) {
- swap(a, b);
- }
- return r;
- }
- int main()
- {
- bool f1 = true;
- string s;
- getline(cin, s);
- vector<long long> a;
- for (long i = 0; i < s.size(); ++i) {
- if (f1) {
- f1 = false;
- while (s[i] == '0') i++;
- }
- a.push_back(s[i]-'0');
- }
- getline(cin, s);
- f1 = true;
- vector<long long> b;
- for (long long i = 0; i < s.size(); ++i) {
- if (f1) {
- f1 = false;
- while (s[i] == '0') i++;
- }
- b.push_back(s[i]-'0');
- }
- vector<long long> ans = sumV(a, b);
- for (long long i = 0; i < ans.size(); ++i) {
- cout << ans[i];
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement