hdu 1003 A + B Problem II 使用整型数组轻松实现大数求和
生活随笔
收集整理的這篇文章主要介紹了
hdu 1003 A + B Problem II 使用整型数组轻松实现大数求和
小編覺得挺不錯的,現在分享給大家,幫大家做個參考.
為題如下:
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 解體代碼如下,實現很簡單,這里就不說明實現過程
轉載于:https://blog.51cto.com/windorman/1195021
總結
以上是生活随笔為你收集整理的hdu 1003 A + B Problem II 使用整型数组轻松实现大数求和的全部內容,希望文章能夠幫你解決所遇到的問題。
- 上一篇: javascript 编程思想
- 下一篇: PrintWriter write与pr