PAT (Advanced Level) Practise 1065 A+B and C (64bit) (20)
来源:互联网 发布:开启服务器端口 编辑:程序博客网 时间:2024/05/21 21:48
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:31 2 32 3 49223372036854775807 -9223372036854775808 0Sample Output:
Case #1: falseCase #2: trueCase #3: false
题意:判断两数和与另一个数的关系
解题思路:数据刚好是超了long long int的,所以用了unsigned long long,符号用标记来记录
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <cmath>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;typedef unsigned long long ull;const ull inf = 1ull << 63;char s[1009];ull a, b, c;int main(){int t, cas = 0;scanf("%d", &t);while (t--){printf("Case #%d: ", ++cas);int flag1 = 0, flag2 = 0, flag3 = 0, flag = 1;scanf("%s", s); flag1 = s[0] == '-'; sscanf(flag1 ? s + 1 : s, "%llu", &a);scanf("%s", s); flag2 = s[0] == '-'; sscanf(flag2 ? s + 1 : s, "%llu", &b);scanf("%s", s); flag3 = s[0] == '-'; sscanf(flag3 ? s + 1 : s, "%llu", &c);if (a == inf && a == b && flag1 == flag2&&flag1) flag = 0;else if (flag1 == flag2) b += a;else{if (flag1){if (a > b) flag2 = 1,b = a - b;else b -= a;}else if (a >= b) flag2 = 0, b = a - b;else b -= a;}if (flag2 == flag3){if (flag2&&b >= c) flag = 0;if (!flag2&&b <= c) flag = 0;}else if (flag2) flag = 0;if (flag) printf("true\n");else printf("false\n");}return 0;}
阅读全文
0 0
- PAT (Advanced Level) Practise 1065 A+B and C (64bit) (20)
- PAT (Advanced Level) Practise 1065 A+B and C (64bit) (20)
- PAT-PAT (Advanced Level) Practise A+B and C (64bit) (20) 【二星级】
- 1065. A+B and C (64bit) (20)【逻辑】——PAT (Advanced Level) Practise
- 【C++】PAT(advanced level)1065. A+B and C (64bit) (20)
- Pat(Advanced Level)Practice--1065(A+B and C (64bit))
- 【PAT (Advanced Level)】1065. A+B and C (64bit) (20)
- PAT (Advanced Level) 1065. A+B and C (64bit) (20) 溢出判断
- 【PAT】【Advanced Level】1065. A+B and C (64bit) (20)
- 浙大PAT (Advanced Level) Practise 1001 A+B Format (20)
- PAT (Advanced Level) Practise 1001 A+B Format (20)
- PAT (Advanced Level) Practise 1001. A+B Format (20)
- PAT (Advanced Level) Practise 1001A+B Format (20)
- PAT (Advanced Level) Practise 1058 A+B in Hogwarts (20)
- PAT (Advanced Level) Practise 1001A+B Format (20)
- PAT (Advanced Level) Practise 1001. A+B Format (20)
- PAT (Advanced Level) Practise 1001. A+B Format (20)
- PAT (Advanced Level) Practise 1001. A+B Format (20)
- hibernate使用SchemaExport生成对应的数据库表
- Merge两个要素后,要素被平滑,节点减少
- spring idref和ref的区别
- 关于Android等待框不显示的问题
- 字符缩进 搞晕了
- PAT (Advanced Level) Practise 1065 A+B and C (64bit) (20)
- Android 跳转到拨号界面及自动拨号
- 网关支付、银联代扣通道、快捷支付、银行卡支付分别是怎么样进行支付的?
- 自己动手实现集合框架类(三)之HashMap
- 微信小程序 pages使用
- Java基础——流的简述
- 机器学习(四)- linear regression
- 依赖注入和控制反转
- ZYNQ的Linux开发--使用SDK生成设备树