Integer Inquiry(大数加法)
来源:互联网 发布:wp config.php 修改 编辑:程序博客网 时间:2024/05/17 22:17
Description
Integer Inquiry
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.
Sample Input
1234567890123456789012345678901234567890123456789012345678901234567890123456789012345678900
Sample Output
370370367037037036703703703670
解题报告
大数快恶心死我了。。。
借用白书里面关于忽略前导零的代码
for(j = 105; j >= 0; j--) if(a[j]) break; for(i = j; i >= 1; i--) printf("%d", a[i]);#include <stdio.h>#include <string.h>char str[100];int n[100];int a[105];int main(){ int i,l,f,c,s,j; memset(a, 0, sizeof(a)); while(scanf("%s", str)) { if(str[0]=='0') break; l=strlen(str); memset(n, 0, sizeof(n)); for(i=0;i<l;i++) n[l-i]=str[i]-'0'; for(i=1;i<=l;i++) a[i]+=n[i]; for(i=1; i<105; i++) { a[i]+=(a[i-1]/10); a[i-1]%=10; } } for(j = 105; j >= 0; j--) if(a[j]) break; for(i = j; i >= 1; i--) printf("%d", a[i]); printf("\n"); return 0;}
- Integer Inquiry(大数加法)
- 大数加法 424 - Integer Inquiry
- Integer Inquiry(大数加法)
- Integer Inquiry 大数加法模板
- POJ 1053 Integer Inquiry && HDOJ 1047 Integer Inquiry (大数加法)
- ZOJ1292 POJ1503 Integer Inquiry 大数加法
- uva 424 Integer Inquiry(大数加法)
- UVA 424 - Integer Inquiry(大数加法)
- uva 424 Integer Inquiry (大数加法)
- POJ--1503:Integer Inquiry 大数加法
- UVA Integer Inquiry(大数加法)
- UVA 424-Integer Inquiry(大数加法)
- HDU1047 - Integer Inquiry (大数加法)
- hdu 1047 Integer Inquiry 大数加法
- POJ 1053 Integer Inquiry (大数加法,还是Java大法好)
- zoj1292--------Integer Inquiry 大数
- Integer Inquiry 大数相加
- HDoj Integer Inquiry(大数)
- 黑马程序员--高新技术(二)
- 走向DBA[MSSQL篇] 从SQL语句的角度 提高数据库的访问性能
- Ubuntu 设置命令行分辨率正确方法
- win32下vs2012 编译 libssh2
- ContentProvider(4):怎样获取其他APP分享的数据
- Integer Inquiry(大数加法)
- 初识XML
- linux编程学习笔记(五) make的使用和Makefile
- 用iptables实现NAT
- 2013年回顾
- jQuery API All Selector (*”)
- javascript apply用法
- Java完全参考手册笔记1
- sqoop的使用