1065. A+B and C (64bit) (20)
来源:互联网 发布:淘宝seo搜索优化工具 编辑:程序博客网 时间:2024/06/04 22:38
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:
31 2 32 3 49223372036854775807 -9223372036854775808 0
Sample Output:
Case #1: falseCase #2: trueCase #3: false
#include <stdio.h>int main(){int T,flag;int i;long long A,B,C,D;scanf("%d",&T);for(i=0;i<T;i++){scanf("%lld%lld%lld",&A,&B,&C);D = A + B;if( A > 0 && B > 0 && D <= 0){flag = 1;}else if(A < 0 && B < 0 && D >= 0){flag = 0;}else if(D > C){flag = 1;}else{flag = 0;}if(flag){printf("Case #%d: true\n",i+1);}else{printf("Case #%d: false\n",i+1);}}return 0;}
0 0
- PAT A 1065. A+B and C (64bit) (20)
- PAT-A 1065. A+B and C (64bit) (20)
- PAT-A-1065. A+B and C (64bit) (20)
- 1065. A+B and C (64bit)
- 1065. A+B and C (64bit)
- 1065. A+B and C (64bit)
- 1065.A+B and C (64bit)
- 1065. A+B and C (64bit)
- 1065. A+B and C (64bit)
- 1065. A+B and C (64bit)
- 1065. A+B and C (64bit)
- 1065. A+B and C (64bit)
- 1065. A+B and C (64bit)
- A+B and C (64bit) (20)
- 1065. A+B and C (64bit) (20)
- 【PAT】1065. A+B and C (64bit) (20)
- 1065. A+B and C (64bit) (20)
- 1065. A+B and C (64bit) (20)
- 统计学习方法---条件随机场2
- android中EventBus总线框架的使用
- mysql存储过程总结
- Java排序算法——选择排序
- variables and types(变量和数据类型)
- 1065. A+B and C (64bit) (20)
- JAVA虚拟机:垃圾收集算法(标记清除算法、复制算法、标记整理算法、分代收集算法)
- 欢迎使用CSDN-markdown编辑器
- Recycler自定义组件二
- php file
- 初学ML笔记N0.6——聚类方法
- STL-空间配置器剖析
- HDU1181
- SNMP协议