ModAdd

input/code.cpp: In function 'int main()':
input/code.cpp:5:53: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define absint(a, b) ( ((a)> (b)) ? (a - b): (b - a)) 
                                                     ^
input/code.cpp:18:19: note: in expansion of macro 'absint'
  for(int i = 0; i<absint(num1.length(), num2.length()); i++){
                   ^
input/code.cpp:29:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i<num1.length(); i++){
                               ^

#include <algorithm>
#include <iostream>
#include <string>

#define absint(a, b) ( ((a)> (b)) ? (a - b): (b - a)) 
#define min(a, b) ( a>b ? b : a)
int main(){
	using namespace std;
	ios::sync_with_stdio(0);

	string num1, num2, pad = "";

	//read first number as string
	getline(cin, num1);
	getline(cin, num2);

	//make same length
	for(int i = 0; i<absint(num1.length(), num2.length()); i++){
		pad += "0";
	}
	if(num1.length() < num2.length()){
		num1 = pad + num1;
	} else {
		num2 = pad + num2;
	}

	int op1, op2;
	//since there is no carry, we can sum from left side and print as we go
	for(int i = 0; i<num1.length(); i++){
		op1 = num1[i] - '0';
		op2 = num2[i] - '0'; 
		num1[i] = ((op1 + op2) % 10) + 48;

	}
	num1.erase(0, min(num1.find_first_not_of('0'), num1.size()-1));

	cout << num1 << "\n";
	
}

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