题目1198：a+b（高精度计算，好像有点问题）

题目链接：http://ac.jobdu.com/problem.php?pid=1198

详解链接：https://github.com/zpfbuaa/JobduInCPlusPlus

参考代码：

//
//  1198 a+b.cpp
//  Jobdu
//
//  Created by PengFei_Zheng on 16/04/2017.
//  Copyright © 2017 PengFei_Zheng. All rights reserved.
//

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <cmath>

using namespace std;

char a[], b[], c[];

int main(){
    while(scanf("%s %s",a,b)!=EOF){
        int lena = (int)strlen(a);
        int lenb = (int)strlen(b);
        int i, j;
        int carry, len, tmp;
        carry = len = tmp = ;

        for(i = lena-, j = lenb-; i >=  && j >= ; i--, j--){
            tmp = a[i]-'' + b[j]-'' +carry;
            c[len++] = tmp%;
            carry = tmp/;
        }

        while(i >= ){
            tmp = carry + a[i] - '';
            c[len++] = tmp%;
            carry = tmp/;
            i--;
        }

        while(j >=  ){
            tmp = carry + b[j] - '';
            c[len++] = tmp%;
            carry = tmp/;
            j--;
        }

        if(carry!=){
            c[len++] = carry;
        }

        len--;
        for(; len>=; len--){
            printf("%d",c[len]);
        }
        printf("\n");
    }
    return ;
}
/**************************************************************
    Problem: 1198
    User: zpfbuaa
    Language: C++
    Result: Accepted
    Time:130 ms
    Memory:1520 kb
****************************************************************/