Integer Inquiry
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14886 Accepted Submission(s): 3811
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
1 123456789012345678901234567890 123456789012345678901234567890 123456789012345678901234567890 0
Sample Output
【推广】 免费学中医,健康全家人原文地址:https://www.cnblogs.com/yxysuanfa/p/7244556.html
- 推荐文章
- 单片机中的ROM,RAM和FLASH的作用
- KEIL5中C/C++优化等级问题
- C语言指针复习
- while 语句判断条件
- 数组名a、数组名取地址&a、数组首地址&a[0]、数组指针*p
- c语言动态链表的创建和插入
- STM32 407的CAN 滤波器学习
- VS2013调试技巧
- 创建动态单链表
- vs2010中出现lnk2019和lnk1120错误
- Ubuntu下开启SSH服务
- linux(allInOne) linuxCommands
- 进一步解 apt-get 的几个命令
- 5分钟理解Centos7防火墙firewalld
- CodeForces
- nyoj55-懒省事的小明(优先队列排序,set)
- poj-1426 Find The Multiple 搜索
- nyoj-1100 WAJUEJI which home strong!(搜索bfs+优先队列)
- nyoj-353 3D dungeon(搜索bfs)
- 珂朵莉的值域连续段
- 数据结构最小生成树两个算法
- hdu-1742Ellipse(自适应辛普森)
- hdu1251统计难题
- codeforces-551C GukiZ hates Boxes
- CodeForces
- codeforces-894C Marco and GCD Sequence
- codeforces-892B Wrath
- codeforces-894B Ralph And His Magic Field
- CodeForces
- CodeForces