A + B Problem II翻译

https://acs.jxnu.edu.cn/problem/HDU1002icon-default.png?t=M0H8https://acs.jxnu.edu.cn/problem/HDU1002

描述:

I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.(我有一个简单的问题给你,给你两个整数A和B,你的任务是计算A+B的和)

输入:

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. (第一行输入包含一个整数T(1<=T<=20)代表测试组数)Then T lines follow, each line consists of two positive integers, A and B. (然后接下来的T行,每一行都由两个正整数A和B组成)Notice that the integers are very large, that means you should not process them by using 32-bit integer.(注意,这个整数很大,意味着你不应该用32位整数来处理) You may assume the length of each integer will not exceed 1000.(你可以假定每个整数的长度不超过1000)

输出:

For each test case, you should output two lines.(对于每一个测试案例,你应该输出两行) The first line is "Case #:", # means the number of the test case.(第一行是"Case #:", #代表测试的组数)The second line is the an equation "A + B = Sum", Sum means the result of A + B.(第二行是一个式子"A + B = Sum",Sum表示A+B的结果) Note there are some spaces int the equation. Output a blank line between two test cases.(注意等式中有一些空格,输出以个空行在两个测试案例之间)

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值