hdu 1047 Integer Inquiry
来源:互联网 发布:房地产中介网站源码 编辑:程序博客网 时间:2024/05/15 13:09
Integer Inquiry
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10490 Accepted Submission(s): 2706
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.)
``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.
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.
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
11234567890123456789012345678901234567890123456789012345678901234567890123456789012345678900
Sample Output
370370367037037036703703703670
#include"stdio.h"#include"stdlib.h"#include"string.h"#define N 105int a[N];int main(){int i,j,n,n1,flag;char ch[N];scanf("%d",&n);while(n--){memset(a,0,sizeof(a)); //数组初始化为零while(scanf("%s",ch),ch[0]!='0') //输入零结束{n1=strlen(ch);for(i=n1-1,j=0;i>=0;i--){a[j++]+=ch[i]-'0'; a[j]+=a[j-1]/10; //进位a[j-1]%=10; //取余}}flag=0;for(i=N-1;i>0;i--){if(flag)printf("%d",a[i]);else if(a[i]){printf("%d",a[i]);flag=1;}}printf("%d\n",a[0]); //输入0时应输出0,错了n多次if(n) //输出块之间有空行printf("\n");}return 0;}
1 0
- HDU 1047 Integer Inquiry
- HDU 1047 Integer Inquiry
- hdu 1047 Integer Inquiry
- hdu 1047 Integer Inquiry
- hdu 1047 Integer Inquiry
- hdu 1047 Integer Inquiry
- hdu-1047Integer Inquiry
- hdu 1047 Integer Inquiry
- HDU 1047 Integer Inquiry
- hdu 1047Integer Inquiry
- hdu 1047 Integer Inquiry
- HDU 1047 Integer Inquiry
- HDU 1047 Integer Inquiry
- HDU 1047 Integer Inquiry
- HDU 1047 Integer Inquiry
- HDU 1047 Integer Inquiry
- HDU 1047 Integer Inquiry
- HDU-1047 Integer Inquiry
- C++错误 LINK : fatal error LNK1168: cannot open Debug/ling.exe for writing
- usaco training 4.1.3 fence6 题解
- java面试题--百度华为的面试题---直接贴代码了
- 使用 OpenSSL API 进行安全编程
- IplImage, CvMat, Mat 的关系和相互转换(转)
- hdu 1047 Integer Inquiry
- pat advanced 1050
- 又沉思了......
- 软件设计是怎样炼成的(6)——打造系统的底蕴(数据库设计)(下篇)
- 南阳 32 组合数
- Deep Learning(深度学习)学习笔记整理
- hdu 1308 What Day Is It? (算星期几)
- C++编程
- HTML5游戏引擎中音频的播放策略