PAT甲级1065
来源:互联网 发布:sql 必须使用别名 编辑:程序博客网 时间:2024/05/22 08:49
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
时间限制
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<iostream>#include<stdio.h>#include<vector>#include<algorithm>using namespace std;int main(){int T;cin >> T;long long A, B, C;long long sum;int i = 1;while (T--){cin >> A >> B >> C;sum = A + B;if(A>0&&B>0&&sum<0)printf("Case #%d: true", i++);else if(A<0&&B<0&&sum>=0)printf("Case #%d: false", i++);else if (sum> C)printf("Case #%d: true", i++);elseprintf("Case #%d: false", i++);cout << endl;}}
0 0
- PAT(甲级)1065
- *浙大PAT甲级 1065
- PAT甲级1065
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- PAT(甲级)1014
- 前端技术学习之选择器(一)
- 快捷判断无损连接
- 实战——二、c#窗体(2)
- CXF与Spring整合开发WebService服务
- FanChat学习笔记(五)——终结篇
- PAT甲级1065
- 排序算法(3):归并排序
- 手机条形码识别
- ioc/aop理解
- 有谁知道怎么做电子报刊的。。给个思路也行
- 解决chrome浏览器一打开就弹出hao123问题, 流氓花样翻新
- 如何实现类似微信的朋友圈界面?
- 数据库范式
- 选择排序