zoukankan      html  css  js  c++  java
  • PATA 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

    #include <cstdio>
    int main(){
    	long long a, b, c;//必须用long long 存储abc
    	int T, num = 0;
    	bool flag;
    	scanf("%d", &T); 
    	while (T--)
    	{
    		scanf("%lld%lld%lld", &a, &b, &c);
    		long long t = a + b;
    		if (a > 0 && b > 0 && t < 0)	flag = true; //正溢出
    		else if (a < 0 && b < 0 && t >= 0)	flag = false;//负溢出
    		else if (t > c)	flag = true;  //未溢出
    		else flag = false;
    		num++;
    		if (flag) printf("Case #%d: true
    ",num);
    		else printf("Case #%d: false
    ", num);
    
    	}
    	return 0;
    }

  • 相关阅读:
    关于jquery动态添加的新元素无法绑定事件那些事
    关于jquery获取json数据的格式问题
    beescms文章列表页函数学习
    beescms相关函数学习
    这是二零一四年十点整的广州
    POJ 1852 Ants 分析
    hiho_1114_扫雷
    hiho_1014_Trie_Tree
    排列组合
    用链表写的冒泡排序理解
  • 原文地址:https://www.cnblogs.com/qiangz/p/8447210.html
Copyright © 2011-2022 走看看