acm例题
来源:互联网 发布:双一流大学 知乎 编辑:程序博客网 时间:2024/04/30 19:11
前面的两个就不写了。以后我没做完一个例题就会发表一篇。不过时间不定,我有时也很少有时间来练习这些题。
/*
acm_1002
Problem Description
I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.
Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line is the an equation "A + B = Sum", Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases.
Sample Input
2 1 2 112233445566778899 998877665544332211
Sample Output
Case 1: 1 + 2 = 3 Case 2: 112233445566778899 + 998877665544332211 = 1111111111111111110
*/
#include<iostream>
#include<cstring>
using namespace std;
char *add(char *a,char *b) //定义函数
{
int i,j,k=0; //循环变量的定义
int temp[1001];
int length1 = strlen(a);
int length2 = strlen(b);
for(i = length1-1, j = length2 -1 ; i >= 0&&j >= 0; --i,--j)
temp[k++] = a[i] + b[j] - '0' - '0';
for(;i >= 0; --i)
temp[k++] = a[i] - '0';
for(;j >= 0; --j)
temp[k++] = b[j] - '0';
temp[k] = 0;
for(i = 0;i < k; ++i)
{
temp[i+1] += temp[i] / 10;
temp[i] %=10;
}
if(!temp[k]) k--;
for(i = 0;i <= k;i++)
a[i] = temp[k-i] + '0';
a[k+1] = '/0';
return a;
}
int main()
{
char a[1001],b[1001],*r;
int number = 0;
int k = 1;
cin >> number;
while(number--)
{
if(cin >> a >> b)
{
cout << "Case "<< k++ << ":/n" << a << " + " << b <<" = ";
r = add(a,b);
cout << r;
cout << endl;
if(number)
cout<<endl;
}
}
return 0;
}
- acm例题
- acm常见算法及例题
- 《ACM程序设计》例题解析-HDU3711
- 《ACM程序设计》例题解析-PKU3187
- 《ACM程序设计》例题解析-PKU1731
- 《ACM程序设计》例题解析-UVa624
- acm常见算法及例题
- ACM 动态规划例题详解
- 《ACM程序设计》例题解析-N皇后问题
- 10道ACM例题让你三天学会STL
- 优先队列详解+ACM例题分析(转载)
- 例题
- 例题
- 例题
- 例题
- ACM日记_17.5.01——数位DP自整理(例题:HDU 2089 不要62)
- 例题6-1 并行程序模拟(Concurrency Simulator, ACM/ICPC World Finals 1991, UVa210)
- 例题6-2 铁轨(Rails, ACM/ICPC CERC 1997, UVa 514)
- webservice服务器端以及客户端调用的方法
- 个端口的漏洞
- 求最大公约数方法的总结
- SQL语句命令大全
- SQL语句功能
- acm例题
- VM虚拟机增加磁盘空间的扩容操作(little by little)
- Ubuntu下安装wicd网络管理工具
- 如何同步化本地svn库到googlecode
- 红旗软件是用中国人的互联网上公开源码的最简单的公有制零件组装出来的==其他公有制软件产品也如此==是零件组装的复杂品.
- 筑基Ajax
- 强烈推荐谷歌浏览器拓展程序adblock-广告过滤
- SVM算法实现(一)
- PHP函数点评