寒假翻译题训练 1月19日

链接：A + B Problem II | JXNUOJ

题目：

描述：

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组样例。余下T行，每一行包括2个正整数A和B。注意这两个整数非常大，这以为着你不能用int类型来运算他们。假设每一个整型的长度不超过1000。

输出：

对于每一个样例，你要输出两行内容。第一行是 "Case #:"，#表示该样例的序数。第二行是方程"A + B = Sum"，SUM表示A+B的结果。注意方程之间存在空格。每两个样例之间需要有一个空行将其隔开。