杭电1002题

最新推荐文章于 2024-08-01 13:41:13 发布

bupt_xycr

最新推荐文章于 2024-08-01 13:41:13 发布

阅读量831

点赞数 1

分类专栏：大数运算

本文链接：https://blog.csdn.net/u013077144/article/details/51211802

版权

大数运算专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Problem Description

I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.

Input

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.

Output

For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line is the an equation "A + B = Sum", Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases.

Sample Input

   
   
    
    2
1 2
112233445566778899 998877665544332211

Sample Output

   
   
    
    Case 1:
1 + 2 = 3

Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110

这是一道大整数加法题很简单

代码如下

    
    
     
     #include<iostream>
#include<string>
using namespace std;
int main()
{
    int j, i, k = 0, a1[1000], a2[999];
    char c1[1000], c2[999];
    int n; cin >> n;
    while (n--)
    {
        memset(a1, 0, sizeof(a1));//归零
        memset(a2, 0, sizeof(a2));
        cin >> c1 >> c2;
        j = 0;
        for (i = strlen(c1) - 1; i >= 0; i--)
            a1[j++] = c1[i] - '0';这步是关键。将字符数组变成int数组，且倒序存储。这样做便于加法的处理 与进位
        j = 0;
        for (i = strlen(c2) - 1; i >= 0; i--)
            a2[j++] = c2[i] - '0';
        for (i = 0; i <= 999; i++)
        {
            a1[i] += a2[i];
            if (a1[i] >= 10)
            {
                a1[i] = a1[i] - 10;
                a1[i + 1]++;
            }
        }
        bool mark = false;
         k ++;
        cout << "Case"<<" "<<k<<":" << endl;
        cout << c1 << " "<<"+" <<" "<< c2<<" "<< "="<<" " ;
        for (i =998; i > 0; i--)
        {
            if (mark)cout << a1[i];
            else
            if (a1[i]){ cout << a1[i]; mark = true; }
        }
        cout << a1[0] << endl;
        if(n>0)cout << endl;
    }
    return 0;
}
     
     memset()函数挺实用的。