ModAdd

#include <iostream>
using namespace std;

int main(){
	ios::sync_with_stdio(0);
	int n,m;
	cin>>n>>m;
	
	int lengthn = to_string(n).length(); 
	int lengthm = to_string(m).length(); 
	int max = lengthn > lengthm ? lengthn : lengthm;
	int arr1[max], arr2[max];
	for (int i = max-1; i >= 0; i--) {
		if(i<=lengthn){
			arr1[i] = n % 10;
			n /= 10;
		} else{
			arr1[i]= 0;
		}
		if(i<=lengthm){
			arr2[i] = m % 10;
			m /= 10;
		} else{
			arr2[i]= 0;
		}
	}
	bool trailZero = true;
	for (int i = 0; i<max; i++){
		int k = (arr1[i] + arr2[i]) % 10;
		if( trailZero && k == 0 ){
			continue;
		}
		trailZero= false;
		cout<<k;
	}
	//cout<<solution;
	return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER