Autumn is a Genius【高精度加减】

Jiajia and Wind have a very cute daughter called Autumn. She is so clever that she can do integer additions when she was just 2 years old! Since a lot of people suspect that Autumn may make mistakes, please write a program to prove that Autumn is a real genius.

Input

The first line contains a single integer T, the number of test cases. The following lines contain 2 integers A, B(A, B < 32768) each. The size of input will not exceed 50K.

Output

The output should contain T lines, each with a single integer, representing the corresponding sum.

---

  设置了上限是32768，但是却没有设置下限啊，可以是负的很大的一个数，可把我坑惨了，而且，一个数x，输入可能是"+ x"或者是"- x"也就是会把符号稍微用一个空格来隔开的，害我以为我高精度写错了哈哈哈。

  最后再提示一句，这是Linux系统的读入方式，最好用正判断，而不是用"!="判断。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(x, y) make_pair(x, y)
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 1e5 + 7;
bool is_num(char x) { return x >= '0' && x <= '9'; }
struct Information
{
    char s[maxN]; int len; bool zf;
    Information() { len = 0; }
    inline void In()
    {
        len = 0; zf = true;
        char ch;
        ch = getchar();
        while(ch != '-' && ch != '+' && !is_num(ch)) ch = getchar();
        while(ch == '-' || ch == '+' || is_num(ch))
        {
            if(ch == '-')
            {
                zf = false;
            }
            else if(ch == '+')
            {
                zf = true;
            }
            else
            {
                s[len++] = ch;
            }
            ch = getchar();
        }
    }
    friend bool operator < (Information e1, Information e2)
    {
        if(e1.len ^ e2.len) return e1.len < e2.len;
        for(int i=0; i<e1.len; i++) if(e1.s[i] ^ e2.s[i]) return e1.s[i] < e2.s[i];
        return true;
    }
    inline void clear()
    {
        for(int i=0; i<len; i++) s[i] = '\0';
        len = 0;
        zf = true;
    }
} a, b, c;
short int dx[maxN], dy[maxN], dz[maxN];
void add()  //a + b
{
    int len = max(a.len, b.len);
    for(int i=0; i<=len + 2; i++) dz[i] = 0;
    for(int i=a.len - 1; i>=0; i--) dx[a.len - i] = a.s[i] - '0';
    for(int i=b.len - 1; i>=0; i--) dy[b.len - i] = b.s[i] - '0';
    for(int i=a.len + 1; i<=len + 2; i++) dx[i] = 0;
    for(int i=b.len + 1; i<=len + 2; i++) dy[i] = 0;
    for(int i=1; i<=len; i++)
    {
        dz[i] += dx[i] + dy[i];
        if(dz[i] > 9)
        {
            dz[i] -= 10;
            dz[i + 1] ++;
            len = max(len, i + 1);
        }
    }
    for(int i=1; i<=len; i++) c.s[len - i] = dz[i] + '0';
    c.s[len] = '\0';
}
void del()  //a - b
{
    int len = max(a.len, b.len);
    for(int i=a.len - 1; i>=0; i--) dx[a.len - i] = a.s[i] - '0';
    for(int i=b.len - 1; i>=0; i--) dy[b.len - i] = b.s[i] - '0';
    for(int i=a.len + 1; i<=len + 1; i++) dx[i] = 0;
    for(int i=b.len + 1; i<=len + 1; i++) dy[i] = 0;
    for(int i=1, pos; i<=len; i++)
    {
        if(dx[i] >= dy[i])
        {
            dx[i] -= dy[i];
        }
        else
        {
            for(pos = i + 1; pos <= len; pos++)
            {
                if(dx[pos])
                {
                    dx[pos]--;
                    if(!dx[pos] && pos == len) len--;
                    break;
                }
            }
            pos--;
            while(pos > i)
            {
                dx[pos] = 9;
                pos--;
            }
            dx[i] = 10 + dx[i] - dy[i];
        }
    }
    while(!dx[len] && len) len--;
    for(int i=1; i<=len; i++) c.s[len - i] = dx[i] + '0';
    c.len = len;
    c.s[len] = '\0';
}
int main()
{
    int T; scanf("%d", &T);
    while(T--)
    {
        a.In();
        b.In();
        c.clear();
        if(a.zf == b.zf)
        {
            add();
            if(!a.zf) printf("-");
            printf("%s\n", c.s);
        }
        else
        {
            bool zf = true;
            if(a.zf)
            {
                if(a < b)
                {
                    swap(a, b);
                    zf = false;
                }
            }
            else
            {
                if(b < a)
                {
                    zf = false;
                }
                else swap(a, b);
            }
            del();
            if(!zf && c.len) printf("-");
            if(!c.len) { c.len = 1; c.s[1] = '\0'; c.s[0] = '0'; }
            printf("%s\n", c.s);
        }
    }
    return 0;
}