NYoj 103 大数相加
来源:互联网 发布:线切割锥度编程 编辑:程序博客网 时间:2024/05/01 05:14
一道简单题,以前用c++写过,今天看了点Java,就用Java写了一下,,,,,,题目:
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 must be positive.
- 输入
- 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.
- 样例输入
21 2112233445566778899 998877665544332211
- 样例输出
Case 1:1 + 2 = 3Case 2:112233445566778899 + 998877665544332211 = 1111111111111111110
import java.util.*;import java.math.BigInteger;public class Main {/** * @param args */public static void main(String[] args) {// TODO Auto-generated method stubBigInteger d,dd; int kk,i;Scanner cin=new Scanner(System.in);kk=cin.nextInt(); for(i=1;i<=kk;++i){d=cin.nextBigInteger();dd=cin.nextBigInteger();System.out.println("Case "+i+":");System.out.println(d+" + "+dd+" = "+d.add(dd));}}}
- NYoj 103 大数相加
- 大数相加-大数取余-nyoj-AC_mm玩dota
- NYOJ A+B IV 小数相加(大数问题)
- NYOJ 114 某种序列(三个数大数相加)
- 大数相加
- 大数相加
- 大数相加
- 大数相加
- 大数相加
- 大数相加
- 大数相加
- 大数相加
- 大数相加
- 大数相加
- 大数相加
- 大数相加
- 大数相加
- 大数相加
- 9-6课堂笔记
- 学习《Java核心技术卷1:基础知识》中对象与类一章中遇到的问题
- HDU 3944
- MFC Windows程序设计(第二版)第一章笔记
- Android定位功能(二)
- NYoj 103 大数相加
- Gamebryo3.0SDK翻译-Lightspeed介绍
- Linux目录解释(蛮全)
- 利用ffmpeg框架扩展android平台解码器
- Gamebryo3.0SDK翻译-NiMesh
- which is 什么时候可以省略
- Java 类集 _foreach 及Enumeration 接口
- Context initialization failed
- 最长公共子串LCS