• [PAT] 1065 A+B and C (64bit) (20 分)Java


    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 package pattest;
     2 
     3 
     4 import java.math.BigInteger;
     5 import java.util.Scanner;
     6 
     7 /**
     8  * @Auther: Xingzheng Wang
     9  * @Date: 2019/2/26 9:59
    10  * @Description: pattest
    11  * @Version: 1.0
    12  */
    13 public class PAT1065 {
    14     public static void main(String[] args) {
    15         Scanner sc = new Scanner(System.in);
    16         int num = sc.nextInt();
    17         for (int i = 1; i <= num; i++) {
    18             BigInteger a, b, c;
    19             a = sc.nextBigInteger();
    20             b = sc.nextBigInteger();
    21             c = sc.nextBigInteger();
    22             if ((a.add(b).compareTo(c)) > 0) {
    23                 System.out.println("Case #" + i +": true");
    24             }else{
    25                 System.out.println("Case #" + i +": false");
    26             }
    27         }
    28     }
    29 }


  • 相关阅读:
    ASP.NET 4.0尚未在 Web 服务器上注册 解决方法
    Node.js
    AC多模式匹配算法
    红黑树的实现原理
    OAuth2.0 用户验证授权标准 理解
    SNMP 和 NetBios协议理解
    使用RSA非对称密钥算法实现硬件设备授权
    常用
    目录列表
    Memcache的 简介
  • 原文地址:https://www.cnblogs.com/PureJava/p/10498106.html
Copyright © 2020-2023  润新知