HDOJ 1047 Integer Inquiry
来源:互联网 发布:视频图片合成软件 编辑:程序博客网 时间:2024/05/21 19:09
Integer Inquiry
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18198 Accepted Submission(s): 4753
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
Source
East Central North America 1996
#include <stdio.h>#include <string.h>#define N 205int main(){int n,lena,l,i,j,flag;char a[N];int a1[N]={0}; int a2[N]; scanf("%d",&n);while(n--){flag=0;while(scanf("%s",a)!=EOF){flag++;if(a[0]=='0'){break;}memset(a2,0,sizeof(a2));lena=strlen(a);for(i=lena-1,l=0;i>=0;i--)a2[l++]=a[i]-'0';for(i=0;i<N;i++){a1[i]+=a2[i];if(a1[i]>=10){a1[i]-=10;a1[i+1]++;}}}if(flag==1){printf("0\n");}else{for(i=N-1;i>=0;i--)if(a1[i])break;for(j=i;j>=0;j--)printf("%d",a1[j]);printf("\n");}if(n!=0)printf("\n");memset(a1,0,sizeof(a1));}return 0;}
0 0
- HDOJ 1047 Integer Inquiry
- HDOJ 1047 Integer Inquiry
- HDOJ 1047 Integer Inquiry
- hdoj 1047 Integer Inquiry
- hdoj 1047 Integer Inquiry
- Integer Inquiry hdoj 1047
- hdoj 1047 Integer Inquiry
- HDOJ 1047 Integer Inquiry
- ACM HDOJ 1047 (Integer Inquiry)
- HDOJ HDU 1047 Integer Inquiry
- HDOJ 1047 Integer Inquiry(大数)
- POJ 1053 Integer Inquiry && HDOJ 1047 Integer Inquiry (大数加法)
- 大数问题之 Integer Inquiry hdoj 1047
- 【大数问题】 HDOJ 1047 Integer Inquiry
- HDOJ 1047 Integer Inquiry(多次大数相加)
- HDoj Integer Inquiry(大数)
- HDOJ Integer Inquiry (大数累加)
- HDOJ 1047 Integer Inquiry (多个大数求和)
- SQLite 大数据量 新增 / 修改 提升效率的办法
- Java并发编程:深入剖析ThreadLocal
- Android 多媒体编程 视频播放
- Android颜色透明度比例对应16进度值
- solr_4.5.0_06:Solr 管理界面使用
- HDOJ 1047 Integer Inquiry
- 派生类的构造函数与析构函数
- Codeforces Round #367 (Div. 2) B Interesting drink【二分】
- 初学c/c++——new和delete
- Redis Sentinel下的数据一致性
- showdoc mac 安装流程
- 洪荒之力的英语翻译(mystical powers)
- AndroidManifest.xml文件中(uses-library)详解
- C# TimeSpan计算代码执行时间差的简易使用