B - Super long sums
来源:互联网 发布:java 自动拆包装包 编辑:程序博客网 时间:2024/06/11 20:54
The Problem
The creators of a new programming language D++ have found out that whatever limit for SuperLongInt type they make, sometimes programmers need to operate even larger numbers. A limit of 1000 digits is so small... You have to find the sum of two numbers with maximal size of 1.000.000 digits.
The Input
The first line of a input file is an integer N, then a blank line followed by N input blocks.The first line of an each input block contains a single number M (1<=M<=1000000) — the length of the integers (in order to make their lengths equal, some leading zeroes can be added). It is followed by these integers written in columns. That is, the next M lines contain two digits each, divided by a space. Each of the two given integers is not less than 1, and the length of their sum does not exceed M.
There is a blank line between input blocks.
The Output
Each output block should contain exactly M digits in a single line representing the sum of these two integers.
There is a blank line between output blocks.
Sample Input
2
4
0 4
4 2
6 8
3 7
3
3 0
7 9
2 8
Sample Output
4750
470
C++代码:
#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#define max 1000005using namespace std;char a[max],b[max],c[max];int main(){ int n,m,i,j; scanf("%d",&n); for(j=0;j<n;j++) { scanf("%d",&m); getchar(); for(i=0;i<m;i++) { a[i]=getchar(); getchar(); b[i]=getchar(); getchar(); } int h=0; for(i=m-1;i>=0;i--) { c[i]=(h+a[i]-'0'+b[i]-'0')%10+'0'; h=(h+a[i]-'0'+b[i]-'0')/10; } printf("%s\n",c); if(j!=n-1)printf("\n"); memset(c,'\0',sizeof(c)); } return 0;}
- B - Super long sums
- UVa 10013 - Super long sums
- UVa 10013 Super long sums (简单高精度)
- (高精度运算4.7.24)UVA 10013 Super long sums(大数加法——某一位的数字可能大于10)
- 【CODEFORCES】 B. Long Jumps
- Problem B. Super 2048
- Sums
- sums
- CodeForces 407B Long Path
- CF 407B - Long Path
- CodeForces 407B Long Path
- Super A^B mod C
- codeforces 407B B. Long Path(dp)
- UVA 12298 Super Poker II (FFT + long double)
- unsigned char _interlockedbittestandset(long volatile *a, long b)问题
- nyoj 844 A+B Problem(V)【long long】
- 1011. A+B和C (15)——long long
- A+B超过long long 大数相加问题
- 使用maven开发的项目,如何更方便地提取第三方包
- 企业邮箱服务优化软件
- centos 6.4 FTP安装和配置
- SAP问题处理总结
- UVA - 11478 Halum (最短路应用+二分)
- B - Super long sums
- IOS研究之网络编程(二)-Cocoa Streams使用详解
- 《Spring3.X企业应用开发实战》学习笔记--SpringMVC
- Linux 下编译、安装、配置 QT
- Java面试
- 450B Jzzhu and Sequences 我考研之后做的第一道题
- UVA 101 (暑期-线性表-D-The Blocks Problem)
- 非常难受
- 续前篇---数据挖掘之聚类算法k-mediod(PAM)原理及实现