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

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

    时间限制
    100 ms
    内存限制
    65536 kB
    代码长度限制
    16000 B
    判题程序
    Standard
    作者
    HOU, Qiming

    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
    
    源代码:
    注意a<0,b<0但是和为0 的情况
    #include <cstdio>
    int main() {
        int T,tcase=1;
        scanf("%d",&T);
        while(T--) {
            long long a,b,c;
            scanf("%lld%lld%lld",&a,&b,&c);
            long long res=a+b;
            bool flag;
            if(a>0&&b>0&&res<0) flag=true;
            else if(a<0&&b<0&&res>=0) flag=false;
            else if(res>c) flag=true;
            else flag=false;
            if(flag) printf("Case #%d: true
    ",tcase++);
            else printf("Case #%d: false
    ",tcase++);
        }
        return 0;
    }
    


  • 相关阅读:
    对于delphi 三层的理解
    XE6调用android标准功能
    修复 XE7 Frame 内 PopupMenu 快捷键失效问题 by 龟山阿卍
    最大熵模型 二
    最大熵模型
    算法复习-平面内极大值点
    算法复习-生成全排列
    算法复习-归并排序
    算法复习-快速排序
    连续特征的离散化
  • 原文地址:https://www.cnblogs.com/lemonbiscuit/p/7775964.html
Copyright © 2011-2022 走看看