当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2602:Superlong sums

题目描述
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 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 file should contain exactly N digits in a single line representing the sum of these two integers.
输入样例
4
0 4
4 2
6 8
3 7
输出样例
4750
提示
Huge input,scanf is recommended.

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-2602

最后修改于 2020-10-29T06:36:48+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000 65536