POJ 1503 Integer Inquiry 简单大数相加
来源:互联网 发布:cn域名删除时间 几点 编辑:程序博客网 时间:2024/06/11 05:27
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.)
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.
Output
Your program should output the sum of the VeryLongIntegers given in the input.
Sample Input
123456789012345678901234567890
123456789012345678901234567890
123456789012345678901234567890
0
Sample Output
370370367037037036703703703670
#include <iostream>#include <string>#include <stdio.h>using namespace std;string doo(string str1,string str2){ string s; int str11=str1.length(); int str22=str2.length(); if(str11>str22){ for(int i=0;i<str11-str22;i++){ str2="0"+str2; } } else{ for(int i=0;i<str22-str11;i++){ str1="0"+str1; } } str11=str1.length(); int cmp=0; int cf=0; for(int i=str11-1;i>=0;i--){ cmp=str1[i]-'0'+str2[i]-'0'+cf; cf=cmp/10; cmp=cmp%10; s=char(cmp+'0')+s; } if(cf!=0){ s=char(cf+'0')+s; } return s;}int main(){ string sum="0"; string str; while(cin>>str){ if(str=="0"){ break; } sum=doo(sum,str); } cout<<sum<<endl; return 0;}
另外二种方法
#include <string>#include <stdlib.h>#include <stdio.h>#include <string.h>char a[200],b[200],c[200],d[200];int main(){ int n1,n2; b[0]='0'; while(1){ scanf("%s",a); if(strcmp(a,"0")==0){ printf("%s\n",b); return 0; } int i; int n1=strlen(a)-1; int n2=strlen(b)-1; int p=0; for(i=0;n1>=0||n2>=0;i++,n1--,n2--) { if(n1>=0&&n2>=0){c[i]=a[n1]+b[n2]-'0'+p;} if(n1>=0&&n2<0){c[i]=a[n1]+p;} if(n1<0&&n2>=0){c[i]=b[n2]+p;} p=0; if(c[i]>'9'){c[i]=c[i]-10;p=1;} } if(p==1){ c[strlen(c)]='1'; } for(int i=0;i<strlen(c);i++){ d[strlen(c)-i-1]=c[i]; } strcpy(b,d); }}
——————————————————
#include <stdio.h>#include <stdlib.h>#include <string.h>char a[200],b[200],c[200];int main(){ //int n1,n2; b[0]='0'; while(~scanf("%s",a)) { if(strcmp(a,"0")==0) { printf("%s\n",b); return 0; } int i; int n1=strlen(a)-1; int n2=strlen(b)-1; int p=0; i=n1; if(i<n2) i=n2; for(i; n1>=0||n2>=0; i--,n1--,n2--) { if(n1>=0&&n2>=0) { c[i]=a[n1]+b[n2]-'0'+p; } if(n1>=0&&n2<0) { c[i]=a[n1]+p; } if(n1<0&&n2>=0) { c[i]=b[n2]+p; } p=0; if(c[i]>'9') { c[i]=c[i]-10; p=1; } } if(p==1) { for(i=strlen(c); i>0; i--) c[i]=c[i-1]; c[0]='1'; } strcpy(b,c); }}
- POJ 1503 Integer Inquiry 简单大数相加
- POJ 1503 Integer Inquiry【大数相加 java】
- POJ 1503 Integer Inquiry(大数相加)
- poj 1503 Integer Inquiry(多个大数相加)
- POJ-1503 Integer Inquiry-多个大数相加
- Integer Inquiry 大数相加
- Integer Inquiry(大数相加)
- Integer Inquiry 大数相加
- PKU-1503 Integer Inquiry(模拟大数相加)
- POJ--1503:Integer Inquiry 大数加法
- zoj_1292 Integer Inquiry(大数相加)
- HDU-1047 Integer Inquiry 大数相加
- hdu1047 Integer Inquiry 多次大数相加
- HDU ACM 1047 Integer Inquiry->大数相加
- HDOJ 1047 Integer Inquiry(多次大数相加)
- poj1503 Integer Inquiry (大数相加)
- hust Integer Inquiry(字符串,大数相加)
- POJ 1503 Integer Inquiry 美丽的大整数相加 + 测试数据
- Java日志性能那些事
- 阅读笔记《JavaScript高级程序设计》
- Android屏幕适配全攻略(最权威的官方适配指导)
- HTML学习6:常用标签之超链接标签
- hadoop 读书笔记(2)
- POJ 1503 Integer Inquiry 简单大数相加
- 挖坑1_float_int/
- android图片特效
- 挖坑2_记得是有东西的。但想不起了,想起了填。
- 第8周实践项目2 - 建立链串的算法库
- C++ 链表
- 分类问题相关指标
- Could not download and install iOS 8.4 Simulator. 需要授权才能安装这些软件包
- HDU——2008 数值统计