POJ 1053 Integer Inquiry && HDOJ 1047 Integer Inquiry (大数加法)
来源:互联网 发布:软件著作权的源代码 编辑:程序博客网 时间:2024/05/21 15:05
题目链接(POJ):http://poj.org/problem?id=1503
题目链接(HDOJ):http://acm.hdu.edu.cn/showproblem.php?pid=1047
Integer Inquiry
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 30856 Accepted: 12007
Description
One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.
``This supercomputer is great,'' remarked Chip. ``I only wish Timothy were here to see these results.'' (Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky apartments on Third Street.)
``This supercomputer is great,'' remarked Chip. ``I only wish Timothy were here to see these results.'' (Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky apartments on Third Street.)
Input
The input will consist of at most 100 lines of text, each of which contains a single VeryLongInteger. Each VeryLongInteger will be 100 or fewer characters in length, and will only contain digits (no VeryLongInteger will be negative).
The final input line will contain a single zero on a line by itself.
The final input line will contain a single zero on a line by itself.
Output
Your program should output the sum of the VeryLongIntegers given in the input.
Sample Input
1234567890123456789012345678901234567890123456789012345678901234567890123456789012345678900
Sample Output
370370367037037036703703703670
Source
East Central North America 1996
题意:求n个大数之和
题解; 大数加法模板题——POJ和HDU上格式出处的要求稍有不同——HDOJ上的描述好混乱。
AC代码(POJ)
#include<iostream>#include<cstring>#include<string>#define maxn 300using namespace std;int numx[maxn],numy[maxn],n;string str,tmp;string Add(string x,string y){ string res=""; memset(numx,0,sizeof(numx)); memset(numy,0,sizeof(numy)); int lenx=x.size(),leny=y.size(); int maxlen=lenx>leny ? lenx:leny; for(int i=0;i<lenx;i++)numx[lenx-i-1]=x[i]-'0'; for(int i=0;i<leny;i++)numy[leny-i-1]=y[i]-'0'; for(int i=0;i<=maxlen;i++){ numx[i]+=numy[i]; if(numx[i]>9){ numx[i+1]+=numx[i]/10; numx[i]%=10; } } int i=maxlen+2; for(;i>0&&!numx[i];)i--; for(;i>=0;i--)res+=numx[i]+'0'; return res;}int main(){ string sum="0"; while(cin>>str&&str!="0") sum=Add(sum,str); cout<<sum<<endl; return 0;}
AC代码(HDU):
#include<iostream>#include<cstring>#include<string>#define maxn 300using namespace std;int numx[maxn],numy[maxn],n;string str,tmp;string Add(string x,string y){ string res=""; memset(numx,0,sizeof(numx)); memset(numy,0,sizeof(numy)); int lenx=x.size(),leny=y.size(); int maxlen=lenx>leny ? lenx:leny; for(int i=0;i<lenx;i++)numx[lenx-i-1]=x[i]-'0'; for(int i=0;i<leny;i++)numy[leny-i-1]=y[i]-'0'; for(int i=0;i<=maxlen;i++){ numx[i]+=numy[i]; if(numx[i]>9){ numx[i+1]+=numx[i]/10; numx[i]%=10; } } int i=maxlen+2; for(;i>0&&!numx[i];)i--; for(;i>=0;i--)res+=numx[i]+'0'; return res;}int main(){ while(cin>>n){ while(n--){ string sum="0"; while(cin>>str&&str!="0"){ sum=Add(sum,str); } cout<<sum<<endl; if(n)cout<<endl; } } return 0;}
【转载请注明出处】
作者:MummyDing
出处:http://blog.csdn.net/mummyding/article/details/43567439
0 0
- POJ 1053 Integer Inquiry && HDOJ 1047 Integer Inquiry (大数加法)
- Integer Inquiry(大数加法)
- HDOJ 1047 Integer Inquiry(大数)
- HDoj Integer Inquiry(大数)
- POJ--1503:Integer Inquiry 大数加法
- POJ 1053 Integer Inquiry (大数加法,还是Java大法好)
- hdu 1047 Integer Inquiry 大数加法
- 大数加法 424 - Integer Inquiry
- Integer Inquiry(大数加法)
- Integer Inquiry 大数加法模板
- 大数问题之 Integer Inquiry hdoj 1047
- 【大数问题】 HDOJ 1047 Integer Inquiry
- HDOJ 1047 Integer Inquiry(多次大数相加)
- HDOJ Integer Inquiry (大数累加)
- HDOJ 1047 Integer Inquiry
- HDOJ 1047 Integer Inquiry
- HDOJ 1047 Integer Inquiry
- hdoj 1047 Integer Inquiry
- 2014年下半年信息系统项目管理师真题试题和答案解析
- [转载]9个offer,12家公司,35场面试,从微软到谷歌,应届计算机毕业生的2012求职之路
- MySQL等数据库整理(2)
- C程序的内存布局(Memory Layout)
- 数据库分库分表系列文章
- POJ 1053 Integer Inquiry && HDOJ 1047 Integer Inquiry (大数加法)
- synchronized修饰方法,保证数据同步准确性,限制线程互斥访问
- 干扰数
- Android中获取SD卡下的图片资源
- 线程调度算法
- 在Android Studio上搭建Robotium测试环境
- 用Win32实现带分割条(Splitter)的窗口
- 输出前十位的Fibonacci 数列
- C语言学习笔记之格式化输出%p