zoukankan      html  css  js  c++  java
  • pat 1065 A+B and C (64bit)(20 分)(大数, Java)

    1065 A+B and C (64bit)(20 分)

    Given three integers A, B and C in [263​​,263​​], you are supposed to tell whether A+B>C.

    Input Specification:

    The first line of the input gives the positive number of test cases, T (10). Then T test cases follow, each consists of a single line containing three integers A, B and C, separated by single spaces.

    Output Specification:

    For each test case, output in one line Case #X: true if A+B>C, or Case #X: false otherwise, where X is the case number (starting from 1).

    Sample Input:

    3
    1 2 3
    2 3 4
    9223372036854775807 -9223372036854775808 0
    

    Sample Output:

    Case #1: false
    Case #2: true
    Case #3: false
     1 import java.math.BigDecimal;
     2 import java.math.BigInteger;
     3 import java.text.DecimalFormat;
     4 import java.util.Scanner;
     5 
     6 import javax.xml.namespace.QName;
     7 
     8 public class Main {
     9 
    10     public static void main(String[] args) {
    11         Scanner scan = new Scanner(System.in);
    12         BigInteger a, b, c;
    13         int t = scan.nextInt();
    14         for (int i = 1; i <= t; ++i) {
    15             a = scan.nextBigInteger();
    16             b = scan.nextBigInteger();
    17             c = scan.nextBigInteger();
    18             String s = a.add(b).subtract(c).toString();
    19             if (s.charAt(0) != '-' && s.charAt(0) != '0')
    20                 System.out.println("Case #" + i + ": true");
    21             else
    22                 System.out.println("Case #" + i + ": false");
    23         }
    24     }
    25 }
  • 相关阅读:
    Win7 华硕电脑自带摄像头无法打开 方法思路介绍
    P3520 [POI2011]SMI-Garbage
    二分图的最大匹配(模板)
    #数列分块入门 2
    数列分块入门#1
    线段树(标记下传乘法和加法)
    最小费用最大流
    最大流算法(模板)
    编译器出现/mingw32/bin/ld.exe:Permission denied 错误
    1298 圆与三角形
  • 原文地址:https://www.cnblogs.com/GetcharZp/p/9592515.html
Copyright © 2011-2022 走看看