POJ-1503-Integer Inquiry-2013-11-25 23:15:45
2014-01-11 21:53
225 查看
Integer Inquiry
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
Sample Output
Source
East Central North America 1996
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 27942 | Accepted: 10859 |
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
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; }
相关文章推荐
- Leetcode: N-Queens
- C.Interface.And.Implementations—sequence的实现
- CareerCup the maximum longest continous sequence of 0s
- 重要经验一:比较两个UIImage是否相同
- uitableview
- 【资料】Fluery's Algorithm( 用于查找Euler path 和Euler circuit)
- ubuintu 12.04 server 系统语言
- Ant之build.xml详解
- UITabBarController的使用
- ZWave for Arduino
- 1.C#泛型-泛型集合Dictionary<Key,Value>
- easyui学习笔记1—增删改操作
- 使用filter解决request.getParameter的中文乱码问题
- ANDROID 中UID与PID的作用与区别
- NGUI DragablePanel与UiStretch的兼容
- ab测试时结果显示大量Request failed的情况分析
- Windows Phone (WP) 跨线程更新界面(UI)
- java 之DelayQueue实际运用示例
- 刷新Activity中的scrollview示例(局部ui刷新)
- (转)Android UI布局中设置了fill_parenet仍然没有全屏的解决办法