Prob 1503 Integer Inquiry 高精度加法

#include <stdio.h>
#include <string.h>

int res[103], a[103];

void jiafa(int a[103], int res[103], int len)
{
        int j = 102, k = len-1;

        for(k; k >= 0; k--, j--){
                res[j] += a[k];
                if(res[j] >= 10){
                        res[j-1]++;
                        res[j] %= 10;
                }
        }

        if(res[j] >= 10){
                while(j >= 0){
                        if(res[j] >= 10){
                                res[j-1]++;
                                res[j] %= 10;
                        }
                        j--;
                }
        }
}

int main(int argc, char **argv)
{
        FILE *fp = NULL;
        char str[103];
        int len, k, temp = 0;

        while(1){
                if((fgets(str, 103, stdin)) && (str[0] == '0') \
                        && (str[1] == '\n')){
                        break;
                }

                len = strlen(str);
                for(k = 0; k < len-1; k++){
                        a[k] = str[k] - 48;
                }

                jiafa(a, res, len-1);
        }

        for(k = 0; k < 103; k++){
                if(res[k]){
                        temp = k;
                        break;
                }
        }

        for(temp; temp < 103; temp++){
                printf("%d", res[temp]);
        }
        printf("\n");

        return 0;
}