ModAdd

input/code.cpp: In function 'int main()':
input/code.cpp:16:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < min(A.size(), B.size()); ++i){
                                           ^
input/code.cpp:21:50: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = min(A.size(), B.size()); j < A.size(); ++j) ans.push_back(A[j] - '0');
                                                  ^
input/code.cpp:22:50: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = min(A.size(), B.size()); j < B.size(); ++j) ans.push_back(B[j] - '0');
                                                  ^

#include <bits/stdc++.h>
#define UNVISITED -1
#define BIGINT 1 << 25
#define _ ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0), cout.precision(15);
using namespace std;

typedef long long int64;
typedef pair<int, int> ii;

int main(){ _
	string A, B;	cin >> A >> B;
	reverse(A.begin(), A.end());
	reverse(B.begin(), B.end());
	
	vector<int> ans;
	for(int i = 0; i < min(A.size(), B.size()); ++i){
		int sum = (A[i] - '0') + (B[i] - '0');
		ans.push_back(sum % 10); 
	}
	
	for(int j = min(A.size(), B.size()); j < A.size(); ++j)	ans.push_back(A[j] - '0');
	for(int j = min(A.size(), B.size()); j < B.size(); ++j)	ans.push_back(B[j] - '0');
	
	for(int i = ans.size() - 1; i > 0; --i)	
		if(ans[i] == 0)	ans.pop_back();
		else	break;
		
	for(int i = ans.size() - 1; i >= 0; --i)
		cout << ans[i];
	cout << endl;
		
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED