大数加法 424 - Integer Inquiry
来源:互联网 发布:网络红人主播国模思瑞 编辑:程序博客网 时间:2024/05/16 08:55
UVa OJ
Root :: AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 1. Elementary Problem Solving :: Big Number
Integer Inquiry
Integer Inquiry
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
1234567890123456789012345678901234567890123456789012345678901234567890123456789012345678900
Sample Output
370370367037037036703703703670
就是最为基础的大数加法,通过一个reverse,将字符串反转之后比较容易处理
大数其实就是模拟,通过计算机模拟我们的手算
要注意输出时,将之前的0去掉
#include<iostream>#include<cstdio>#include<cstring>#include<ctype.h>#include<algorithm>using namespace std;char num[150][150];int sum[150]={0};int main (){ int t=0,i,j,max=0; memset(num,0,sizeof(num)); memset(sum,0,sizeof(sum)); while(gets(num[t])) { if (num[t][0]=='0') break; int len=strlen(num[t]); if (max<len) max=len; for (i=0, j=len-1; i<j; i++, j--) { char temp; temp=num[t][i]; num[t][i]=num[t][j]; num[t][j]=temp; } t++; } for (j=0; j<=max; j++) { for (i=0; i<t; i++) if (isdigit(num[i][j])) sum[j]+=num[i][j]-'0'; if (sum[j]>=10) { sum[j+1]+=sum[j]/10; sum[j]=sum[j]%10; } } while(sum[j]==0) j--; for (i=j; i>=0; i--) cout<<sum[i]; cout<<endl; return 0;}
- 大数加法 424 - Integer Inquiry
- Integer Inquiry(大数加法)
- uva 424 Integer Inquiry(大数加法)
- UVA 424 - Integer Inquiry(大数加法)
- uva 424 Integer Inquiry (大数加法)
- UVA 424-Integer Inquiry(大数加法)
- Integer Inquiry(大数加法)
- Integer Inquiry 大数加法模板
- POJ 1053 Integer Inquiry && HDOJ 1047 Integer Inquiry (大数加法)
- ZOJ1292 POJ1503 Integer Inquiry 大数加法
- POJ--1503:Integer Inquiry 大数加法
- UVA Integer Inquiry(大数加法)
- HDU1047 - Integer Inquiry (大数加法)
- hdu 1047 Integer Inquiry 大数加法
- POJ 1053 Integer Inquiry (大数加法,还是Java大法好)
- uva 424 Integer Inquiry(高精度加法)
- UVA 424 Integer Inquiry 高精度加法
- UVA 424 Integer Inquiry (高精度加法)
- notepad++ 去行号:正则匹配
- cmd 命令 之 dir 之 强化使用
- qt
- poj 2288 Islands and Bridges
- go语言创建web服务器(简单方便)
- 大数加法 424 - Integer Inquiry
- Uploadify.js
- 在一台服务器绑定多个IP
- 好了,今天暑假的训练就开始了。
- 关于NS2跨层设计实现的一些有用资料整理
- java数据类型内存分配简记
- Redis设计与实现读书笔记——双链表
- Android 笔记之 clearTaskOnLaunch&finishOnTaskLaunch
- maven-android-parent