高精度加法与减法

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
void getnum(char *st,char *ss)
{
    int len,i,j,k,l;
    len=strlen(ss);
    for(i=len-1;i>=0;i--)
        st[len-1-i]=ss[i];
    st[len]='\0';
}
void add(char s1[],char s2[])
{
    //printf("a");
    int i,j,k,l,len1,len2;
    char s[40];
    len1=strlen(s1);
    len2=strlen(s2);
    if(s1[len1-1]=='-')
        len1--;
    if(s2[len2-1]=='-')
        len2--;
    int c;
    i=0;c=0;
    while(i<len1&&i<len2)
    {
        s[i]=(s1[i]+s2[i]-'0'-'0'+c)%10+'0';
        c=(s1[i]+s2[i]-'0'-'0'+c)/10;
        i++;
    }
    if(len1>i)
    {
        while(i<len1)
        {
            s[i]=(s1[i]-'0'+c)%10+'0';
            c=(s1[i]-'0'+c)/10;
            i++;
        }
    }
    else if(len2>i)
    {
        while(i<len2)
        {
            s[i]=(s2[i]-'0'+c)%10+'0';
            c=(s2[i]-'0'+c)/10;
            i++;
        }
    }
    if(c==1)
        s[i++]='1';
    s[i]='\0';
    int len=strlen(s);
    for(i=len-1;i>=0;i--)
        printf("%c",s[i]);
    printf("\n");
}
int judge(char s1[],char s2[])
{
    int i,j,k,l,len1,len2,c;
    len1=strlen(s1);
    len2=strlen(s2);
    if(len1>len2)
        return 1;
    else if(len1<len2)
        return 0;
    else
    {
        c=0;
        if(s1[len1-1]=='-')
            len1--;
        i=len1-1;
        while(i>=0)
        {
            if(s1[i]>s2[i])
                return 1;
            else if(s1[i]<s2[i])
                return 0;
            i--;
        }
        return 1;
    }
}
void sub(char s1[],char s2[])
{
//    printf("%s\n%s\n",s1,s2);
    int i,j,k,l,len1,len2;
    char s[40];
    len1=strlen(s1);
    len2=strlen(s2);
    if(s1[len1-1]=='-')
        len1--;
    if(s2[len2-1]=='-')
        len2--;
    //printf("#%d %d\n",len1,len2);
    i=0;
    int c=0;
    while(i<len1&&i<len2)
    {
        if(s1[i]>=s2[i]+c)
        {
            s[i]=s1[i]-s2[i]-c+'0';
            c=0;
        }
        else
        {
            s[i]=s1[i]+10-s2[i]-c+'0';
            c=1;
        }
        i++;
    }
    if(len1>i)
    {
        while(i<len1)
        {
            if(s1[i]-'0'>=c)
            {
                s[i]=s1[i]-c;
                c=0;
            }
            else
            {
                s[i]=s1[i]+10-c;
                c=1;
            }
            i++;
        }
    }
//    printf("*");
//    for(i=len1-1;i>=0;i--)
//        printf("%c",s[i]);
//    printf("\n");
    for(i=len1-1;i>0&&s[i]=='0';i--)
    {
        len1--;
    }
    s[len1]='\0';
    int len=strlen(s);
    for(i=len-1;i>=0;i--)
        printf("%c",s[i]);
    printf("\n");
}
int main()
{
    char s[40],s1[40],s2[40];
    int i,j,k,l,t,len1,len2;
    while(scanf("%d",&t)!=EOF)
    {
        for(l=1;l<=t;l++)
        {
            scanf("%s",s);
            getnum(s1,s);
            scanf("%s",s);
            getnum(s2,s);
            len1=strlen(s1);
            len2=strlen(s2);
            if(s1[len1-1]=='-'^s2[len2-1]=='-')
            {
                add(s1,s2);
            }
            else
            {
                if(judge(s1,s2))
                    sub(s1,s2);
                else
                    sub(s2,s1);
            }
        }
    }
    return 0;
}