OJ-Problems-Source/CodeVS/3116_冰封.c

/*
作者:千里冰封
题目:p3116 高精度练习之加法
*/

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

char *jjfly(char *s){
    char *h, *t;
    char c;
    h = s;
    t = s + strlen(s) - 1;
//    printf("%h=%p,t=%p\n", h, t);
    while (h < t) {
        c = *h;
        *(h++) = *t;
        *(t--) = c;
    }
    return s;
}

int main(void){
    char *a,*b,*c;
    int i,j,max,min;
    int ifis = 0;
    a = (char*)malloc(sizeof(char)*600);
    b = (char*)malloc(sizeof(char)*600);
    c = (char*)malloc(sizeof(char)*600);

    scanf("%s",a);
    scanf("%s",b);

    jjfly(a);
    jjfly(b);

    if(strlen(a)>strlen(b)){
        max = strlen(b);
        min = strlen(a);
        strcpy(c,a);
    }
    else{
        max = strlen(a);
        min = strlen(b);
        strcpy(c,b);
    }

    for(i = 0; i < max; i++){
        j = (a[i]-'0' + b[i]-'0');
        j += ifis;
        ifis = 0;
        if(j>9){
             j-=10;
             ifis++;
        }
//        printf("%d",j);
        c[i] = j+'0';
        j = 0;
    }

    for(i = max; i < min; i++){
        j = c[i] - '0';
        j += ifis;
        ifis = 0;
        if(j>9){
             j-=10;
             ifis++;
        }
        c[i] = j+'0';
    }

    jjfly(c);
    if(ifis != 0){
        printf("%d",ifis);
    }
    puts(c);

//    system("pause");

    return 0;
}