POJ 2602Superlong sums
来源:互联网 发布:java编写对话框 编辑:程序博客网 时间:2024/06/08 19:17
Time Limit: 2000MS
Memory Limit: 65536KTotal Submissions: 22108
Accepted: 6509
Memory Limit: 65536KTotal Submissions: 22108
Accepted: 6509
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
代码:
#include <iostream>
using namespace std;
char a[1000001];
int main()
{
int i,b,carry,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d",&a[i],&b);
a[i]+=b;
}
for(carry=0;i--;)
{
a[i]+=carry;
if(a[i]>9)
{
carry=1;
a[i]%=10;
}
else
{
carry=0;
}
a[i]+='0';
}
puts(a);
return 0;
}
using namespace std;
char a[1000001];
int main()
{
int i,b,carry,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d",&a[i],&b);
a[i]+=b;
}
for(carry=0;i--;)
{
a[i]+=carry;
if(a[i]>9)
{
carry=1;
a[i]%=10;
}
else
{
carry=0;
}
a[i]+='0';
}
puts(a);
return 0;
}
0 0
- POJ 2602 Superlong sums
- POJ 2602Superlong sums
- POJ 2602 Superlong sums
- poj-2602-Superlong sums
- poj 大数 - 2602 Superlong sums
- POJ 2602 Superlong sums G++
- POJ 2602 Superlong sums 大整数求和
- 北大ACM POJ 2602 Superlong sums
- Poj 2602 Superlong sums(大数相加)
- POJ 2602 Superlong sums (高精度,模拟,水题)
- Poj OpenJudge 百练 2602 Superlong sums
- POJ 2602 Superlong sums(模拟大数加法)
- POJ 2602 Superlong sums(高精度)
- POJ 2602|URAL 1048|Superlong Sums|高精度加法
- 北大 ACM 2602 Superlong sums
- POJ2602 Superlong sums
- ural 1048 Superlong Sums
- Poj2602 Superlong sums
- 人之初,性本善?
- 输入输出流--I/O流
- 【搬运工】Spring MVC和Struts2的比较
- 左岸:如何修炼成某一领域的高手
- java从头学day03[循环语句]
- POJ 2602Superlong sums
- brk系统调用实现分析
- thinkphp getField( )和field( )
- jquery easyui tree改变默认图标
- MySQL控制台执行SQL脚本
- 数据库DB-MSSQL 系统了解
- FMALV********响应回车事件
- 让我们来嚼makefile---make给makefile内部变量赋值
- Oracle:sqlplus命令行登录方法 as sysdba