HDU
来源:互联网 发布:汽修管理系统源码 编辑:程序博客网 时间:2024/05/29 04:26
Integer Inquiry
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22232 Accepted Submission(s): 6027
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
vector的模拟
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <queue>#include <stack>#include <map>#include <cmath>#include <vector>#define max_ 100010#define inf 0x3f3f3f3f#define ll long longusing namespace std;vector<int>v[4];void add(string a){v[0].clear();v[2].clear();int i=a.size()-1;while(a[i]=='0'&&i>=1)i--;for(;i>=0;i--){v[0].push_back((a[i]-'0'));}if(v[0].size()>v[1].size())swap(v[0],v[1]);i=0;int cf=0;int l=v[0].size();for(;i<l;i++){int d=v[0][i]+v[1][i]+cf;v[2].push_back(d%10);cf=d/10;}l=v[1].size();for(;i<l;i++){int d=v[1][i]+cf;v[2].push_back(d%10);cf=d/10;}while(cf!=0){v[2].push_back(cf%10);cf/=10;}v[1]=v[2];}int main(int argc, char const *argv[]){int t;cin>>t;while(t--){string a;for(int i=0;i<4;i++)v[i].clear();int f=0;while(cin>>a&&a!="0"){f=1;add(a);}if(f==0)printf("0");for(int i=v[2].size()-1;i>=0;i--){printf("%d",v[2][i]);}printf("\n");if(t!=0)printf("\n");}// system("pause");return 0;}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- centos6.4 /etc/resolv.conf文件改了重启网络就自动还原了
- Windows线程启动到消亡的运行状态
- PHP 导出csv格式excel
- 如何检验你是否是一个合格的初级java开发者
- 文件指针偏移的相关函数(rewind ftell fseek)
- HDU
- Java数据结构---冒泡排序
- [DP] HDU 1024
- java中GC测试总结
- Ubuntu 安装docky
- HDU
- Boosting:XGBoost思想及数据推导详细过程
- 康拓展开
- java web 之路:tomcat