POJ-1503-Integer Inquiry-2013-11-25 23:15:45
来源:互联网 发布:cadseeplus是什么软件 编辑:程序博客网 时间:2024/06/06 09:24
Integer Inquiry
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27942 Accepted: 10859
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
# include<stdio.h># include<string.h>int main(){char num[110];int num1[110],sum[110],len,i,j;memset(num,0,sizeof(num));memset(sum,0,sizeof(sum));memset(num1,0,sizeof(num1));while(scanf("%s",num) && strcmp("0",num)!=0){len = strlen(num);j = 0;for(i=len-1;i>=0;i--)num1[j++] = num[i] - '0'; for(i=0;i<105;i++){sum[i] = num1[i] + sum[i];if(sum[i]>=10){sum[i]-=10;num1[i+1]++;}}memset(num1,0,sizeof(num1));memset(num,0,sizeof(num));}for(i=104;i>=0;i--)if(sum[i]!=0)break;for(;i>=0;i--)printf("%d",sum[i]);printf("\n");return 0;}
0 0
- POJ-1503-Integer Inquiry-2013-11-25 23:15:45
- 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
- bonjour 概述
- c++鼠标操作详解
- test
- 黑马程序员-用eclipse进行Java界面可视化设计
- 固定资产年结10步
- POJ-1503-Integer Inquiry-2013-11-25 23:15:45
- 将log4j的日志配置输出到mysql中
- 并行处理 mpi矩阵乘法
- 用趋势赢未来,数字化重构新商业
- NSEntityDescription 创建 NSEntityDescription 对象和NSManagedObject 对象
- 传统企业,互联网革命正在踢门!
- Uncaught TypeError: string is not a function
- FindFirstFile、FindNext递归遍历硬盘的文件
- SRM 551 - 450 ColorfulWolves