超大非负整数的减法~

抽空写了个大数减法~~~~

1182: a-b
Time Limit: 10 Sec Memory Limit: 128 MB
[Submit][Status][Web Board]
Description

求a-b的值

Input

第一行一个整数T，表示接下来有T行

每行两个整数是a，b，（0<=a，b<=10^10000）

Output

输出值

Sample Input

2
100 98
100000000000000000000 1

Sample Output

2
99999999999999999999
AC代码~：

#include<stdio.h>
#include<string.h>
#include <iostream>
#define N 10005
using namespace std;
char a[N],b[N],c[N];
int lenth_a,lenth_b,f;
void Def(char x[],char y[],char z[])
{
    int m,n,k;
    f = 0;
    int lenth_x = strlen(x),lenth_y =strlen(y);
    int def = lenth_x - lenth_y;
    int M = def+lenth_y+5;
    char d[M];
    fill(d,d+M,'\0');
    fill(d,d+def,'0');
    strcat(d,y);
    for(int i = lenth_x-1; i >= 0; i--)
    {
        k = 0;
        m = x[i]-'0';
        n = d[i]-'0';
        if(m >= n)
        {
            z[f++] = m-n+'0';
        }
        else
        {
           while(m < n)
           {
               m = x[i] -'0';
               m += (++k)*10;
           }
           x[i-1] = (x[i-1]-'0')-k+'0';
           z[f++] = m-n+'0';
        }
    }
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        fill(a,a+N,'\0');
        fill(b,b+N,'\0');
        fill(c,c+N,'0');
        scanf("%s %s",a,b);
        lenth_a= strlen(a),lenth_b=strlen(b);
        int flag = 0;
        if(lenth_a > lenth_b)
        {
            flag = 1;
        }
        else if(lenth_a == lenth_b)
        {
            if(strcmp(a,b)>0)
                flag = 1;
        }
        flag?(Def(a,b,c)):(Def(b,a,c));
        if(flag == 0&&strcmp(a,b)!=0) printf("-");
        while(c[f]=='0')
            f--;
        if(f!=-1)
        {
            for(int i = f; i >=0; i--)
            {
                printf("%c",c[i]);
            }
        }
        else printf("0");
        printf("\n");
    }
    return 0;
}