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

    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
     1 #include<stdio.h>
     2 #include<math.h>
     3 #include<stdlib.h>
     4 #include<string.h>
     5 
     6 int main()
     7 {
     8     int i, t;
     9     scanf("%d", &t);
    10     long long a, b, c;
    11     for(i = 1; i <= t; i++)
    12     {
    13         scanf("%lld%lld%lld", &a, &b, &c);
    14         long long sum = a + b;
    15         if(a > 0 && b > 0 && sum < 0)
    16             printf("Case #%d: true
    ", i);
    17         else if(a < 0 && b < 0 && sum >= 0)
    18             printf("Case #%d: false
    ", i);
    19         else if(sum > c)
    20             printf("Case #%d: true
    ", i);
    21         else
    22             printf("Case #%d: false
    ", i);
    23     }
    24     return 0;
    25 }
  • 相关阅读:
    数组实现队列
    qsort用法 (转)
    枚举法
    HDU 2293
    bfs 街道赛跑
    漫谈二分查找Binary Search (转)
    qsort 结构体二级排序实例
    优化枚举法
    10项比较重要的.NET技术
    ADO.NET SQL Provider 和 ADO.NET OLE DB Provider 和 ADO.NET ODBC Provider 性能对比。
  • 原文地址:https://www.cnblogs.com/yomman/p/4267868.html
Copyright © 2011-2022 走看看