博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
hdoj 1002 A + B Problem II 高精度 java
阅读量:6689 次
发布时间:2019-06-25

本文共 1622 字,大约阅读时间需要 5 分钟。

A + B Problem II

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 241933    Accepted Submission(s): 46646

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
 
 
题意:
高精度a+b
 
 
题解
java大法好!
 
import java.util.*;   import java.io.*;   import java.math.*;     public class Main{       public static void main(String[] args) {           Scanner in = new Scanner(System.in);        int t=in.nextInt();        for(int i=1;i<=t;i++)        {            if(i!=1)                System.out.println();            BigInteger a = in.nextBigInteger();            BigInteger b = in.nextBigInteger();            System.out.println("Case "+i+":");            System.out.println(a+" + "+b+" = "+a.add(b));        }    }   }

 

 
 

转载地址:http://pyhao.baihongyu.com/

你可能感兴趣的文章
hdu 素数环
查看>>
H3C CAS 介绍 & 基本概念
查看>>
xxx
查看>>
openSUSE 安装 Caffe
查看>>
你可能没注意的CSS单位
查看>>
咱计算机专业的人,能不能不那么特别地彰显对语文的无知?——再谈面向对象......
查看>>
foreach Transform 同时chils.setParent引起的bug
查看>>
AES加密--适用于RC2、RC4和Blowfish
查看>>
如何强制删除一个apk
查看>>
SHA算法摘要处理
查看>>
[HEOI2012]采花 BZOJ2743
查看>>
Codevs 3305 水果姐逛水果街Ⅱ 倍增LCA
查看>>
【智力题】程序员面试经典
查看>>
第五次作业
查看>>
使用ObjectAnimator设置动画
查看>>
细思《都挺好》
查看>>
(转)awk命令
查看>>
java实现双向链表
查看>>
微信公众号教程(6)公众平台开发模式介绍
查看>>
java 动态代理的学习详解
查看>>