POJ 1503 Integer Inquiry
来源:互联网 发布:java 引用其他文件方法 编辑:程序博客网 时间:2024/05/21 10:32
Integer Inquiry
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25317 Accepted: 9831
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
解题思路:多个大数相加,注意有前导0,然后就没有然后了。
#include<iostream>using namespace std;int ans[110],temp[110];void add(int n){int i,j,k;for(i=0;i<n;i++)ans[i]+=temp[i];for(j=109;;j--)if(ans[j])break;for(k=0;k<=j;k++){ans[k+1]+=ans[k]/10;ans[k]%=10;}}int main(){char num[105][105];int i=1,j,k;memset(num,'\0',sizeof(num));memset(ans,0,sizeof(ans));memset(temp,0,sizeof(temp));while(cin>>num[i]){if(strcmp(num[i],"0")==0)break;else{k=0; for(j=strlen(num[i])-1;j>=0;j--) temp[k++]=num[i][j]-'0'; add(strlen(num[i++]));}}for(k=109;;k--)if(ans[k])break;for(;k>=0;k--) cout<<ans[k];cout<<endl;return 0;}
- POJ – 1503 Integer Inquiry Integer Inquiry
- POJ 1503 Integer Inquiry
- poj 1503 Integer Inquiry
- POJ 1503 Integer Inquiry
- poj 1503 Integer Inquiry
- POJ 1503 Integer Inquiry
- POJ 1503 Integer Inquiry
- POJ---1503 Integer Inquiry
- poj 1503 Integer Inquiry
- POJ 1503 Integer Inquiry
- POJ 1503Integer Inquiry
- POJ 1503 Integer Inquiry
- POJ 1503 Integer Inquiry
- poj 1503 Integer Inquiry
- POJ-1503 Integer Inquiry
- POJ 1503 Integer Inquiry
- POJ 1503 Integer Inquiry
- poj 1503 Integer Inquiry
- 2013年计划
- Java关闭所有IE窗口
- Objective-c的Foundation中常用类2——NSString和NSMutableString
- Windows Store apps开发[85]Windows 8 开发31日-第27日-倾斜仪
- BeautifulSoup中文乱码解决问题 python 爬虫 乱码
- POJ 1503 Integer Inquiry
- php5.3.6的php_intl.dll加载不上解决方法
- C++之模板
- 网络摄象机常用传输协议
- 数据结构---->图的应用(拓扑排序,关键路径)
- 【Boost】boost::string_algo详解7——join的应用
- PHPBB3获取最近发表的文章
- Kernel panic - not syncing: Attempted to kill init
- 虚幻3引擎简介--阴影