HDOJ 1047 Integer Inquiry(多个大数相加)
来源:互联网 发布:外国人万能的淘宝 编辑:程序博客网 时间:2024/06/06 18:39
Integer Inquiry
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17864 Accepted Submission(s): 4652
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
370370367037037036703703703670
写个加法的子函数,通过循环将大数相加。
代码如下:
#include<stdio.h>#include<string.h>int a[110];char s[110],str[110];void add(char s[],int a[]){int b[110],i,len,j;memset(b,0,sizeof(b));len=strlen(s);for(i=0;i<len;i++) b[len-i-1]=s[i]-'0';for(i=0;i<len;i++){a[i]+=b[i];if(a[i]>9){a[i+1]++;a[i]-=10;}}}int main(){int n,i,j;scanf("%d",&n);while(n--){memset(a,0,sizeof(a));while(scanf("%s",&str)&&strcmp(str,"0")!=0){add(str,a);}for(i=110;i>0;i--) if(a[i]) break;for(;i>=0;i--) printf("%d",a[i]);printf("\n");if(n) printf("\n");}return 0;}
0 0
- HDOJ 1047 Integer Inquiry(多个大数相加)
- hdoj 1047 Integer Inquiry 【多个大数相加】
- HDU 1047 Integer Inquiry (多个大数相加)
- HDOJ 1047 Integer Inquiry(多次大数相加)
- HDOJ 1047 Integer Inquiry (多个大数求和)
- HDU 1047 Integer Inquiry 多个大数相加
- 杭电—1047 多个大数相加 Integer Inquiry
- poj 1503 Integer Inquiry(多个大数相加)
- POJ-1503 Integer Inquiry-多个大数相加
- HDOJ 1047 Integer Inquiry(大数)
- Integer Inquiry 大数相加
- Integer Inquiry(大数相加)
- Integer Inquiry 大数相加
- HDU-1047 Integer Inquiry 大数相加
- HDU ACM 1047 Integer Inquiry->大数相加
- zoj_1292 Integer Inquiry(大数相加)
- poj1503 Integer Inquiry (大数相加)
- HDoj Integer Inquiry(大数)
- ac自动机模版hdu2222
- ios developer tiny share-20160720
- 汉诺塔问题的python实现
- java之环境变量配置
- [源码学习][知了开发]WebMagic-OOSpider
- HDOJ 1047 Integer Inquiry(多个大数相加)
- HDOJ 1232 畅通工程(并查集)
- Linux学习笔记之守护进程
- malloc,realloc,calloc的介绍与区别
- 1800: [Ahoi2009]fly 飞行棋
- 计蒜客- 简单斐波那契
- Android Activity的四大启动模式
- UVA-591 Box of Bricks
- 克鲁斯卡尔算法+普里姆算法 详解