翻译No.7

A + B Problem II

1000ms 32768K

描述:

I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.

输入:

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.

输出:

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.

翻译:

我有一个非常简单的问题,给你两个整数A和B,你的任务是计算出A+B的和

输入:

第一行输出包含一个整数T(1<=T<=20)代表测试次数,

接下来的T行每行有两个正整数A和B,注意这两个数可能特别大,意味着你不能用32位的整型int来存放他们,你需要假设这两个整数不会超过1000位.

输出:

对于每次测试,你需要输出两行,第一行是"Case#:"#代表测试次数的序号,第二行是一个等式"A + B = sum",sum指的是A+B的结果,,注意在等式之间有空格,在输出两个测试样例之间有空行

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值