Envío 3711

Código

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <deque>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;
const int N = 6e5+20;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    string s1;
    string s2;
    
    int carry = 0;
    deque<int> num1;
    deque<int> num2;
    cin>>s1>>s2;
    for(int i = 0; i < s1.size(); i++)
    {
        num1.push_front(s1[i] - '0');
    }
    for(int i = 0; i < s2.size(); i++)
    {
        num2.push_front(s2[i] - '0');
    }
    
    for(int j = 0; j < s2.size(); j++)
    { 
        carry += num2[j];
        int x;
        if(j >= num1.size())
        {
            num1.push_back(num2[j]);
        }
        else
        {
            for(int i = j; i < num1.size(); i++)
            {
                if(num1[i]+carry <= 9)
                {
                    num1[i]+=carry;
                    carry = 0;
                    break;
                }
                else if (i==num1.size()-1)
                {
                    num1[i] = num1[i]+carry-10;
                    num1.push_back(1);
                    carry = 0;
                }
                else
                {
                    num1[i] = num1[i]+carry-10;
                    carry = 1;
                }
            }
        }
    }

    for(int i = num1.size()-1; i >= 0; i--)
    {
        cout<<num1[i];
    }
    cout<<endl;
}