POJ2602-Superlong sums
来源:互联网 发布:淘宝关键词挖掘 编辑:程序博客网 时间:2024/05/29 15:24
Superlong sums
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 23240 Accepted: 6901
Description
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.
Input
The first line of an input file contains a single number N (1<=N<=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 N 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 N.
Output
Output file should contain exactly N digits in a single line representing the sum of these two integers.
Sample Input
40 44 26 83 7
Sample Output
4750
Hint
Huge input,scanf is recommended.
Source
Ural State University collegiate programming contest 2000
题意:给出两个长度为n的序列分别表示一个数,输出这两个数的和,第一行为一整数n表示两序列长度,之后n行每行两个数字(介于0到9之间)分别表示两序列相应位置的数字,并且保证两数和的位数不超过n
解题思路:模拟
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;const double pi = acos(-1.0);const double eps = 1e-8;char a, b, c[1000006];int main(){int n;while (~scanf("%d", &n)){getchar();for (int i = 0; i<n; i++){a = getchar();getchar();b = getchar();getchar();c[i] = '0' + a - '0' + b - '0';int t = i;while (c[t]>'9'){c[t] -= 10;c[--t] += 1;}}for (int i = 0; i<n; i++)putchar(c[i]);printf("\n");}return 0;}
0 0
- POJ2602 Superlong sums
- Poj2602 Superlong sums
- poj2602 Superlong sums(高精度)
- POJ2602-Superlong sums
- poj2602——Superlong sums
- ACM篇:POJ2602--Superlong Sums
- POJ2602《Superlong sums》方法:高精度 模拟
- POJ 2602 Superlong sums
- ural 1048 Superlong Sums
- POJ 2602Superlong sums
- POJ 2602 Superlong sums
- poj-2602-Superlong sums
- 北大 ACM 2602 Superlong sums
- poj 大数 - 2602 Superlong sums
- ural 1048. Superlong Sums 模拟
- POJ 2602 Superlong sums G++
- POJ 2602 Superlong sums 大整数求和
- 北大ACM POJ 2602 Superlong sums
- 从头到尾彻底解析Hash表算法
- win10环境下shadowsocks+VM12.5.2下ubuntu使用谷歌搜索
- IDEA2017.2最新版BUG
- 51Nod1010 只包含因子2 3 5的数 (二分
- 【SQL基础】case when和decode的用法与区别
- POJ2602-Superlong sums
- ORA-01017: invalid username/password; logon denied
- 关于Python的进程线程协程之大话多进程多线程
- hihoCoder 1015 : KMP算法
- POJ1062-昂贵的聘礼
- Linux中常用操作命令
- IDEA玩法- 自动补充标签(括号式)
- 项目管理的严谨性
- IDEA激活码llicense破解方法2017-2016版本通用