UVa 10013 Super long sums (简单高精度)
来源:互联网 发布:md655ll a支持什么网络 编辑:程序博客网 时间:2024/05/16 17:36
10013 - Super long sums
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=954
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
240 44 26 83 733 07 92 8
Sample Output
4750470
完整代码:
/*0.915s*/#include<cstdio>int a[1000010], b[1000010], c[1000010];int main(){int t, M, i, k, carry;scanf("%d", &t);while (t--){scanf("%d", &M);for (i = 0; i < M; ++i)scanf("%d%d", &a[i], &b[i]);carry = 0;for (i = M - 1; i >= 0; --i){k = carry + a[i] + b[i];carry = k > 9 ? 1 : 0;c[i] = k % 10;}for (i = 0; i < M; i++)printf("%d", c[i]);putchar(10);if(t) putchar(10);}return 0;}
- UVa 10013 Super long sums (简单高精度)
- UVa 10013 - Super long sums
- (高精度运算4.7.24)UVA 10013 Super long sums(大数加法——某一位的数字可能大于10)
- B - Super long sums
- poj2602 Superlong sums(高精度)
- UVA 12298 Super Poker II (FFT + long double)
- UVA 10106 Product 简单高精度乘法
- UVa 10487 - Closest Sums
- UVa 10487 - Closest Sums
- uva 10487 - Closest Sums
- uva 10487 - Closest Sums
- UVa 10487 - Closest Sums
- UVa 10487 - Closest Sums
- UVa 10487 - Closest Sums
- uva 10487 - Closest Sums
- UVA 10487 - Closest Sums
- uva 10487 Closest Sums
- uva 10487 Closest Sums
- office在线预览功能开发
- 唐老师数据结构专题八2
- Linux 上的游戏 Supertuxkart
- C++ 函数指针 & 类成员函数指针
- linux常用命令之二
- UVa 10013 Super long sums (简单高精度)
- JQuery 模糊匹配
- 配置samba服务器
- c中利用字符串操作实现用户自己输入文件名
- HTTP 协议详解
- 【PAT1063】Set Similarity 求两集合的交集、并集
- mac+Iterm2命令
- 十三周——最大公约数(递归版)
- svn2git使用小记