大数加法
来源:互联网 发布:专业数据库恢复 编辑:程序博客网 时间:2024/05/22 19:48
A - 你会敲A+B吗?
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uDescription
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.
Sample Input
1234567890123456789012345678901234567890123456789012345678901234567890123456789012345678900
Sample Output
370370367037037036703703703670
代码张鑫提供
#include<stdio.h>#include<stdlib.h>#include<string.h>char a[1000];int num[1000];int main(){ memset(num,0,sizeof(num)); int MAX=0,i; while(scanf("%s",a),strcmp(a,"0")) { if(strlen(a)>MAX) { MAX=strlen(a); } for(i=strlen(a)-1;i>=0;i--) { num[strlen(a)-1-i]+=a[i]-'0'; } for(i=0;i<(MAX+10);i++) { if(num[i]>9) { num[i+1]+=num[i]/10; num[i]=num[i]%10; } else { num[i]=num[i]; } } } int st; for(st=(MAX+10);st>=0;st--) { if(num[st]!=0) { break; } } if(st<0) { printf("0"); } else { for(i=st;i>=0;i--) { printf("%d",num[i]); } } printf("\n"); return 0;}
0 0
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 大数加法
- 笔记本电池修复常见方法大全
- poj 1470 Closest Common Ancestors(简单的LCA算法)
- linux下环境变量操作API
- 动态函数调用实现下列操作,输入2个数以及操作符计算结果。@求最大公约数 $求最小公倍数 -求差 +求和
- Codeforces Beta Round #17 D题 福大核武 景润后人!!!
- 大数加法
- Java 中 泛型的限定
- C程序设计语言(K&R)第二章学习笔记
- leetcode3题解 Max Points on a line
- 空格替换
- 水晶报表之自定义函数
- 简单字符串排序
- iOS地图和定位
- poj3281Dining网络流-最大流