大数减法

1. #include <cstdio>
2. #include <cstring>
3. #include <iostream>
4. #define maxn 107
5. using namespace std;
7. char a[maxn],b[maxn];//接受输入的字符串
8. int ta[maxn],tb[maxn];//倒序记录输入的字符串
10. int main()
11. {
12.     int i,t;
13.     int len1,len2;
14.     scanf("%d",&t);
15.     while (t--)
16.     {
17.         //注意要请0
18.         memset(ta,0,sizeof(ta));
19.         memset(tb,0,sizeof(tb));
20.         scanf("%s%s",a,b);
21.         len1 = strlen(a);
22.         len2 = strlen(b);
23.         int len = max(len1,len2);
24.         //两个数组统一宽度，倒序记录在ta,tb中，多出的0补上
25.         for (i = 0; i < len; ++i)
26.         {
27.             if (len1 - 1 >= 0)
28.             {
29.                 ta[i] = a[len1 - 1] - '0';
30.                 len1--;
31.             }
32.             else ta[i] = 0;
33.             if (len2 - 1 >= 0)
34.             {
35.                 tb[i] = b[len2 -  1] - '0';
36.                 len2--;
37.             }
38.             else tb[i] = 0;
39.         }
40.         //模拟加法的过程
41.         for (i = 0; i < len; ++i)
42.         {
43.             ta[i] = ta[i] - tb[i];
44.             if (ta[i] < 0)
45.             {
46.                 ta[i + 1] -= 1;
47.                 ta[i] += 10;
48.             }
49.         }
50.         bool flag = false;
51.         //false表示前边还没有出现1-9的数，true表示前边出现了1-9的数字
52.         //可以处理多余的前导0
53.         for (i = len; i >= 0; --i)
54.         {
55.             if (flag || ta[i])
56.             {
57.                 flag = true;
58.                 printf("%d",ta[i]);
59.             }
60.         }
61.         if (!flag) printf("0");
62.         printf("\n");
63.     }
64.     return 0;
65. }