CF 1619C - Wrong Addition

C. Wrong Addition

Tanya is learning how to add numbers, but so far she is not doing it correctly. She is adding two numbers $a$ and $b$ using the following algorithm:

1. If one of the numbers is shorter than the other, Tanya adds leading zeros so that the numbers are the same length.
2. The numbers are processed from right to left (that is, from the least significant digits to the most significant).
3. In the first step, she adds the last digit of $a$ to the last digit of $b$ and writes their sum in the answer.
4. At each next step, she performs the same operation on each pair of digits in the same place and writes the result to the left side of the answer.

For example, the numbers $a=17236$ and $b=3465$ Tanya adds up as follows:

• calculates the sum of $6+5=11$ and writes $11$ in the answer.
• calculates the sum of $3+6=9$ and writes the result to the left side of the answer to get $911$.
• calculates the sum of $2+4=6$ and writes the result to the left side of the answer to get $6911$.
• calculates the sum of $7+3=10$, and writes the result to the left side of the answer to get $106911$.
• calculates the sum of $1+0=1$ and writes the result to the left side of he answer and get $1106911$.

As a result, she gets $1106911$.
 
You are given two positive integers $a$ and $s$. Find the number $b$ such that by adding $a$ and $b$ as described above, Tanya will get $s$. Or determine that no suitable $b$ exists.
 
Input
The first line of input data contains an integer $t(1\le t\le 10^4)$ — the number of test cases.
Each test case consists of a single line containing two positive integers $a$ and $s$ ($1\le a<s\le 10$¹⁸) separated by a space.
Output
For each test case print the answer on a separate line.
If the solution exists, print a single positive integer $b$. The answer must be written without leading zeros. If multiple answers exist, print any of them.
If no suitable number $b$ exists, output $-1$.
 
Example
input

6
17236 1106911
1 5
108 112
12345 1023412
1 11
1 20

output

3465
4
-1
90007
10
-1

Note
The first test case is explained in the main part of the statement.
In the third test case, we cannot choose $b$ that satisfies the problem statement.

题目大意:
$s$ 是由 $a$ 和 $b$ 的每一对应数位相加之后的结果组合而组成的(对应数位不存在的用0加)。我们要做的是反过来，由题目给出的 $s$ 和 $a$ 求出 $b$。
解题思路:
由题意可以得出，$a$ 和 $b$ 的每一位都是 0 ~ 9 的数，也就是说 $s$ 中的每一或两位数减去 $a$ 的一位数只能得出 $b$ 的其中一位数，即差为 0 ~ 9，若超出范围就不存在合适的 $b$ 了。
从右往左进行计算，分别获取 $s$ 和 $a$ 的一位数，若 $s$取的一位数 比 $a$的一位数小，则 $s$ 再取一位数，然后进行相减(s的减a的)。若差值在 0 ~ 9 则认为是正确的并进行组合，若不在这个范围，则认为不存在这样的 $b$ (差值小于0的：$s$ 不够减且 $s$ 没有向左多一位或左一位为0，此时 $b$ 为负数；差值大于9的：此时 $b$ 的其中一部分为两位数)。综上，若有这样的 $b$ 则进行输出，若没有则输出 $-1$。

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    int t; cin>>t;
    while (t--)
    {
        ll a, s; cin>>a>>s;
        ll ta, ts, t=1;
        ll b = 0;
        bool flag = true; //是否 b 的每一位数都满足要求
        while(a || s) // s 的每(1或2)位和 a 的每一位都要进行一次计算
        {
            //获取 a 和 s 的低位数
            ta = a%10; a /= 10;
            ts = s%10; s /= 10;
            if(ts < ta) //若 s 不能减去 a 则再多取一位
            {
                ts += s%10*10;
                s /= 10;
            }
            //获取差值
            int tb = ts - ta;
            //差值在 0~9 范围内才是符合 b 每一位数的要求的
            //否则就认为不存在合适的 b
            if(tb<0 || tb>9)
            {
                flag = false;
                break;
            }
            b += tb*t;
            t *= 10;
        }
        cout<<(flag?b:-1)<<'\n';
    }
    return 0;
}