hdoj 1047 Integer Inquiry(几个大数连续加)
2015-09-20 01:33
381 查看
Integer Inquiry
[b]Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15840 Accepted Submission(s): 4068
[/b]
Problem 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.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
Sample Input
1 123456789012345678901234567890 123456789012345678901234567890 123456789012345678901234567890 0
Sample Output
370370367037037036703703703670 按照大数加做就行了!、 代码: [code]#include<stdio.h> #include<string.h> int main() { int n,k=0; scanf("%d",&n); while(n--) { int i,j,flag=1; char ch[1010]; int s[1010],c[1010]; memset(s,0,sizeof(s)); memset(c,0,sizeof(c));//清零 while(scanf("%s",ch)!=EOF&&strcmp(ch,"0")!=0) { flag=0; int l=strlen(ch); for(i=0,j=l-1;i<l;i++)// 大数加模板 { c[j--]=ch[i]-'0'; } for(i=0;i<l;i++) { s[i]+=c[i]; if(s[i]>=10) { s[i+1]++; s[i]-=10; } } } if(flag)//判断是否只有一个数0 printf("0\n"); else { for(i=1000;i>=0;i--) if(s[i]!=0) break; for(;i>=0;i--) printf("%d",s[i]); printf("\n"); } k++; if(n!=0)//注意格式 printf("\n"); } return 0; }
[/code]
相关文章推荐
- Permutation Sequence (略)
- QuickCalc | 快计算
- CryptoGUI | 文件加解密
- UGUI 锚点坑
- ios(总结)UISearchBar
- 点击UICollectionViewCell上的UIButton如何获取当前的UICollectionViewCell?
- 【Xamarin 开发 IOS --使用 Storyboard Segue 实作 UIViewController 的切换 (实例)】
- 【Xamarin 开发 IOS --IOS 页面导航概念Segue】
- que0que.cc:: Short introduction to query graphs
- java GUI--day22
- Guide to installing 3rd party JARs
- 条款37:绝不重新定义继承而来的缺省参数值(Never redefine a function's inherited default parameter value)
- 使用存取方法来设置Property value
- iOS ui设计的乐土
- 初试jQuey
- UI控件——UISlider:滑动条
- iOS UIAlertController 弹框 (ios 9.0 后代替了UIAlertView弹框 和 UIActionSheet下弹框)
- easyui datagrid学习笔记
- UIButton超出UIView边界不可点击,应该怎么办?
- hdu 1503 Advanced Fruits(最长公共子序列的应用)