1065 A+B and C (64bit) (20 分)

1065 A+B and C (64bit) (20 分)
Given three integers A, B and C in [−2
​63
​​ ,2
​63
​​ ], 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>
using namespace std;
int main()
{int t;cin >> t;for (int i = 1; i <= t; i++){long long a, b, c,sum;scanf("%lld%lld%lld", &a, &b, &c);//这里不能用cin,知道为什么的告诉我一声。很迷cout << "Case #" << i << ": ";sum = a + b;if (a > 0 && b > 0 && sum < 0)cout << "true";else if (a < 0 && b < 0 && sum >= 0)cout << "false";else if (sum > c)cout << "true";elsecout << "false";cout<<endl;}return 0;
}

本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.mzph.cn/news/428770.shtml

如若内容造成侵权/违法违规/事实不符,请联系多彩编程网进行投诉反馈email:809451989@qq.com,一经查实,立即删除!

相关文章

7-3 寻找大富翁 (25 分)

7-3 寻找大富翁 (25 分) 胡润研究院的调查显示&#xff0c;截至2017年底&#xff0c;中国个人资产超过1亿元的高净值人群达15万人。假设给出N个人的个人资产值&#xff0c;请快速找出资产排前M位的大富翁。输入格式: 输入首先给出两个正整数N&#xff08;≤10 ​6 ​​ &#…

7-8 德才论 (25 分)(C语言实现)

7-8 德才论 (25 分) 宋代史学家司马光在《资治通鉴》中有一段著名的“德才论”&#xff1a;“是故才德全尽谓之圣人&#xff0c;才德兼亡谓之愚人&#xff0c;德胜才谓之君子&#xff0c;才胜德谓之小人。凡取人之术&#xff0c;苟不得圣人&#xff0c;君子而与之&#xff0c;…

899. 编辑距离

编辑距离 #include <iostream> #include <cstring> #include <algorithm> using namespace std; int f[1001][1001]; int main() {char ch[1001][13];int n, m;cin >> n >> m;for (int i 0; i < n; i){scanf("%s",ch[i]1);}while…

282. 石子合并

石子合并 #include<algorithm> #include<iostream> using namespace std; const int N 303; int f[N][N]; int s[N]; int main() {int n;cin>>n;for (int i1;i<n;i) cin>>s[i],s[i]s[i-1];for (int len 2;len<n;len)//len长度{for (int i1;il…

868. 筛质数

筛质数 埃及筛法&#xff1a; #include<iostream> #include<cstring> #include<algorithm> using namespace std; int main() {int n,cnt0;bool p[1000010];memset(p,true,sizeof(p));cin>>n;for (int i1;i<n;i){if (p[i]true) cnt;for (int j ii…

870. 约数个数

约数个数 约数个数就是所有数的质因子的个数加一相乘 #include <iostream> #include <set> #include <map> #include <cmath> using namespace std; const int mod 1e9 7; int main() {map<int, int> mp;int n, m;cin >> n;while (n--)…

900. 整数划分

整数划分 两种方案&#xff1a; 第一种&#xff1a;f[i][j] f[i-1][j-1]f[i-j][j]//i表示数量&#xff0c;j表示分几个数 #include <iostream> using namespace std; const int N 1050; const int mod 1e9 7; int f[N][N]; int main() {int n;cin >> n;f[0][0…

3617. 子矩形计数

子矩形计数 #include <iostream> #include <cmath> using namespace std; int a[40041], b[40041]; //int num1[40041],num2[40041]; pair<int, int> f[40041]; int main() {int n, m, k;int num;cin >> n >> m >> k;int cou1 0, cou2 …

常用的一些表和字段

1.【VBAK:销售凭证】 字段&#xff1a;vbeln(销售凭证)、erdat(创建日期)、ername(创建者)、auart(销售类型)、bstnk(采购订单)、bsark(采购订单类型)、bstdk(采购日期)2.【VBAP:销售凭证行项目】 字段&#xff1a;vbeln(销售凭证)、posnr(项目)、matnr(物料)、werks(工厂)、lg…

手风琴案例jquery写法

今天我用jquary来写一下手风琴案例&#xff0c;这个案例在平时的项目中很经常会见到&#xff0c;要想实现效果用jquary来写其实很简单&#xff0c;其实一句话就是jquary的方法的调用。 首先我们先来分析一下手风琴案例实际实现的效果&#xff0c;就是点击当前的标题&#xff0c…

801. 二进制中1的个数

二进制中1的个数 #include<iostream> using namespace std; int h; int main() {int n,num;cin>>n;for (int i0;i<n;i){cin>>num;int cou 0;for (int i0;i<31;i){h num>>i&1;if (h1) cou;}cout<<cou<<" ";} }

D. Omkar and Medians

D. Omkar and Medians Uh oh! Ray lost his array yet again! However, Omkar might be able to help because he thinks he has found the OmkArray of Rays array. The OmkArray of an array a with elements a1,a2,…,a2k−1, is the array b with elements b1,b2,…,bk su…

元组tuple

另一种有序列表叫元组&#xff1a;tuple。tuple和list非常类似&#xff0c;但是tuple一旦初始化就不能修改&#xff0c;比如同样是列出同学的名字&#xff1a; >>> classmates (Michael, Bob, Tracy)现在&#xff0c;classmates这个tuple不能变了&#xff0c;它也没有…

3493. 最大的和

最大的和 滑动窗口 #include <iostream> #define int long long using namespace std; signed main() {int n, k, sum 0, a[101001], b[100101], c[100101];cin >> n >> k;for (int i 1; i < n; i){cin >> a[i];}for (int i 1; i < n; i){ci…

delphi ---ttoolbar,ttoolbutton

1、button style&#xff1a;tbsButton&#xff0c;tbsCheck&#xff0c;tbsDivider&#xff0c;tbsDropDown&#xff0c;tbsSeparator&#xff0c;tbsTextButton tbsButton&#xff1a;普通的控件 tbsSeparator&#xff1a;用作分隔 tbsDropDown&#xff1a;下拉控件&#xff…

3481. 阶乘的和

阶乘的和 #include <iostream> #include <unordered_set> using namespace std; unordered_set<int> S; int main() {int f[11];f[0] 1;for (int i 1; i < 10; i){f[i] f[i - 1] * i;}for (int i 1; i < 1 << 10; i){int s 0;for (int j …

win7下的nginx小demo

一直大概知道nginx怎么玩,但是不看文档又蒙蔽.在这记录一下,以后好查看 下载tomcat,改index.jsp http://tomcat.apache.org/download-80.cgi tomcat9已经出来了,但是自己用了一次,闪退,换tomcat8,开启成功.(tomcat9这个原因有时间在琢磨) 修改tomcat的index.jsp 然后在index.js…

understand的安装

1.win7 64位下安装 1&#xff09;下载Understand.4.0.908.x64.rar。 2&#xff09;解压之&#xff0c;直接运行里面的Understand-4.0.908-Windows-64bit.exe。 3&#xff09;选择如下 之后&#xff0c;点击“Add Eval or SDL (RegCode)”&#xff0c;如下图&#xff1a; 4&…

C. Number of Pairs

C. Number of Pairs You are given an array a of n integers. Find the number of pairs (i,j) (1≤i<j≤n) where the sum of aiaj is greater than or equal to l and less than or equal to r (that is, l≤aiaj≤r). For example, if n3, a[5,1,2], l4 and r7, then t…

A. Arithmetic Array Codeforces Round #726 (Div. 2)

A. Arithmetic Array An array b of length k is called good if its arithmetic mean is equal to 1. More formally, if b1⋯bkk1. Note that the value b1⋯bkk is not rounded up or down. For example, the array [1,1,1,2] has an arithmetic mean of 1.25, which is no…