#include <iostream> #include <algorithm> using namespace std; void add(char a[],char b[], char c[]) { int len_a = strlen(a),len_b = strlen(b); int len_c = len_a > len_b ? len_a : len_b; ++len_c; memset(c,'0',len_c); memset(a+len_a,'0',len_c-len_a); memset(b+len_b,'0',len_c-len_b); int carry = 0,temp = 0,i; for (i = 0; i < len_c; ++i) { temp = a[i] - '0' + b[i] -'0' + carry; carry = temp / 10; c[i] += temp % 10; } if (carry > 0) c[i] += carry,len_c++; for (i = len_c-1; i >= 0 && c[i] == '0'; --i) c[i+1] = 0; len_c = i+1; } int main() { int num; cin >> num; while (num--) { char buf1[300] = {0},buf2[300] = {0},buf3[300] = {0}; scanf("%s %s",buf1,buf2); add(buf1,buf2,buf3); int i = strlen(buf3)-1; for ( ; i >= 0 && buf3[i] == '0';--i) ; buf3[i+1] = 0; for (i = 0; i <= strlen(buf3); ++i) if (buf3[i] != '0') break; printf("%s/n",buf3+i); } return 0; }