11303: [yosupo] Big Integer - Addition of Big Integers
[Creator : ]
Description
This problem has $T$ cases.
Given integers $A$ and $B$, print $A+B$.
Given integers $A$ and $B$, print $A+B$.
Input
$T$
$A$ $B$
$\vdots$
$A$ $B$
$A$ $B$
$\vdots$
$A$ $B$
Output
$A+B$
$\vdots$
$A+B$
$\vdots$
$A+B$
Constraints
- $1 \leq T \leq 2\times 10^5$
- $0 \leq |A|, |B| < 10^{2\times 10^5}$
- The sum of (the number of characters in $A$) $+$ (the number of characters in $B$) over all test cases does not exceed $4,000,002$.
- $0 \leq |A|, |B| < 10^{2\times 10^5}$
- The sum of (the number of characters in $A$) $+$ (the number of characters in $B$) over all test cases does not exceed $4,000,002$.
Sample 1 Input
9
47 10
50 10
3 -10
0 -10
-12 -34
12345678901234567890 98765432109876543210
-12345678901234567890 98765432109876543210
-12345678901234567890 -98765432109876543210
12345678901234567890 -12345678901234567890
Sample 1 Output
57
60
-7
-10
-46
111111111011111111100
86419753208641975320
-111111111011111111100
0