zoukankan      html  css  js  c++  java
  • 1065 A+B and C (64bit) (20 分)

    Given three integers A, B and C in [−], 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 (≤). 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

    单独判断上溢和下溢即可

    #include<bits/stdc++.h>
    using namespace std;
    const int maxn=100010;
    int main(){
        long long a,b,c,sum;
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%lld %lld %lld",&a,&b,&c);
            sum=a+b;
            if(a>0&&b>0&&sum<0){
                printf("Case #%d: true
    ",i+1);
            }
            else if(a<0&&b<0&&sum>=0){
                printf("Case #%d: false
    ",i+1);
            }
            else if(sum>c){
                printf("Case #%d: true
    ",i+1);
            }
            else{
                    printf("Case #%d: false
    ",i+1);
            }
        }
        return 0;
    }
    
    
    
     
  • 相关阅读:
    序列操作
    上帝造题的七分钟2 / 花神游历各国
    火柴排队
    pair(对组)用法
    线段树
    链上分治
    Rem与Px的转换
    css中单位px和em,rem的区别
    css网页自适应-1
    css网页自适应-2
  • 原文地址:https://www.cnblogs.com/dreamzj/p/14465753.html
Copyright © 2011-2022 走看看