HDU1002大数加法

大数加法

c++版：

#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define MAX(a,b) (a > b ? a : b)
#define MIN(a,b) (a < b ? a : b)
#define mem0(a) memset(a,0,sizeof(a))

typedef long long LL;
const double eps = 1e-12;
const int MAXN = 1005;
const int MAXM = 5005;

char a[MAXN], b[MAXN];

void slove()
{
    int lena = strlen(a);
    int lenb = strlen(b);
    strrev(a);  strrev(b);
    int p = 0;
    while(a[p] || b[p])
    {
        if(a[p]>='0') a[p] -= '0';
        if(b[p]>='0') b[p] -= '0';
        a[p] += b[p];
        a[p+1] += a[p]/10;
        a[p] = a[p] % 10 + '0';
        p++;
    }
    strrev(a);
}

int main()
{
    int T, Case=0;
    scanf("%d", &T);
    while(T--)
    {
        mem0(a); mem0(b);
        scanf("%s %s%*c", a, b);
        printf("Case %d:
", ++Case);
        printf("%s + %s = ", a, b);
        slove();
        printf("%s
", a);
        if(T) printf("
");
    }
    return 0;
}

java版：

import java.math.*;
import java.util.*;
import java.io.*;

public class Main{
    
    public static void main(String[] args) throws Exception
    {
        
        Scanner cin = new Scanner(new BufferedInputStream(System.in));
        int T = cin.nextInt();
        int c = 1;
        while((T--) != 0)//多组输入
        {
            BigInteger a,b;
            a = cin.nextBigInteger();
            b = cin.nextBigInteger();
            System.out.println("Case " + (c++) + ":");
            System.out.println(a + " + " + b + " = " + a.add(b));
            if(T != 0) System.out.println();
        }
    }
}