HPU 1002 A + B Problem II【大数】

A + B Problem II

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 261413 Accepted Submission(s): 50581

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

Author

Ignatius.L

思路：

将数字以字符的形式存储到字符数组中，由于在存储的时候是高位在以0为下标的下标变量中存储的。所以要将其进行翻转，存储到整形数组中（也就是高位存储到大下标变量中。由于在进位的时候能在原来的基础上进行i++。来存储最高位的数据）。然后将两个大数按位相加。假设比十大，进行进位操作！

代码：

#include <stdio.h>
#include <string.h>
#define N 10005
char a[N],b[N];
int c[N],d[N];
int main()
{int n,i,j,k,len1,len2;scanf("%d",&n);k=n;while(n--){memset(c,0,sizeof(c));//每次都得清零，所以得放到while循环里面。 memset(d,0,sizeof(d));getchar();scanf("%s%s",a,b);//空格也是scanf的切割符！ len1=strlen(a);len2=strlen(b);for(i=len1-1,j=0;i>=0;i--)//由于须要逆序保存，所以应该设变量j从0開始！

c[j++]=a[i]-'0'; for(i=len2-1,j=0;i>=0;i--) d[j++]=b[i]-'0'; for(i=0;i<1001;i++) { c[i]+=d[i]; if(c[i]>=10) { c[i]-=10; c[i+1]++; } } printf("Case %d:\n%s + %s = ",k-n,a,b); for(i=1000;i>=0&&c[i]==0;i--); if(i>=0) for(;i>=0;i--) { printf("%d",c[i]); } else printf("0"); printf("\n"); if(n!=0) printf("\n"); } return 0; }

posted on 2017-07-03 10:41 mthoutai 阅读(...) 评论(...) 编辑收藏

转载于:https://www.cnblogs.com/mthoutai/p/7109952.html

HPU 1002 A + B Problem II【大数】相关推荐

HDU - 1002 A + B Problem II(大数)
题目链接:点击查看题目大意:大数加法题目分析:第一次用Java写ACM,还是有点小激动滴,有几点需要注意的: 公共类名要写Main 不要提交包名注意输入输出上代码吧,纪念一下: import ...
HDU.1002 A + B Problem II
原题 HDU.1002 A + B Problem II 分类杂题·大位整数运算题意计算从任意两个长度在1000以内的正整数的和. 输入/输出要求与格式输入内容最开始一行开始输入样例数,对 ...
hdu A + B Problem II(大数相加，数组实现)
hdu A + B Problem II(大数相加,数组实现) 题目走起注意最后一个case 不需要换行下面代码 #include<stdio.h> #include<strin ...
HDOJ 1002 A + B Problem II 解题报告
今天研究 1002,,,搞得半死,虽说是一道简单的题目,真正做起来绝不是很容易的... A + B Problem II Time Limit: 2000/1000 MS (Java/Others) ...
Hdu - 1002 - A + B Problem II
题目: A + B Problem II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Oth ...
HDU1002 Problem II(大数相加)（C++题解）
A题 HDOJ1002(大数加法) A + B Problem II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/327 ...
HDU 1002 A + B Problem II
ACM OJ题解目录本题网址:https://cn.vjudge.net/problem/HDU-1002 A + B Problem II I have a very simple problem ...
hdu 1002 A+B problem II
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1002 题目分析:高精度问题,大整数相加. 由此题可见java相较于C/C++的优势,即丰富多彩的类以及 ...
A + B Problem II 大数加法
题目描述: Input The first line of the input contains an integer T(1<=T<=20) which means the number ...

HPU 1002 A + B Problem II【大数】

A + B Problem II

思路：

代码：

HPU 1002 A + B Problem II【大数】相关推荐

最新文章

热门文章