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

要输入字符串，longlongint不够

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

HOU, Qiming

Given three integers A, B and C in [-2⁶³, 2⁶³], 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

来源： <http://www.patest.cn/contests/pat-a-practise/1065>

 

1. #include <iostream>
2. #include <math.h>
3. #include <string>
4. #define INF 10000000
6. using namespace std;
9. long long int ahigh=0, alow = 0, bhigh = 0, blow = 0, chigh = 0, clow = 0;
10. bool Cmp(void) {
12. if (ahigh + bhigh > chigh)
13. return true;
14. else if (ahigh + bhigh < chigh)
15. return false;
16. else {
17. if (alow + blow > clow)
18. return true;
19. else
20. return false;
21. }
22. }
26. int main(void) {
27. int n;
28. cin >> n;
29. for (int i = 0; i < n; i++) {
30. string a, b, c;
31. cin >> a >> b >> c;
32. ahigh = 0;
33. bhigh = 0;
34. chigh = 0;
35. alow = 0;
36. blow = 0;
37. clow = 0;
38. if (a.length() > 9) {
39. for (int j = 0; j < a.length() - 9; j++) {
40. ahigh *= 10;
41. ahigh = ahigh + a[j] - '0';
42. }
43. for (int j = a.length() - 9; j < a.length(); j++) {
44. alow *= 10;
45. alow = alow + a[j] - '0';
46. }
47. }
48. else {
49. ahigh = 0;
50. for (int j = 0; j < a.length(); j++) {
51. alow *= 10;
52. alow = alow + a[j] - '0';
53. }
54. }
56. if (b.length() > 9) {
57. for (int j = 0; j < b.length() - 9; j++) {
58. bhigh *= 10;
59. bhigh = bhigh + b[j] - '0';
60. }
61. for (int j = b.length() - 9; j < b.length(); j++) {
62. blow *= 10;
63. blow = blow + b[j] - '0';
64. }
65. }
66. else {
67. bhigh = 0;
68. for (int j = 0; j < b.length(); j++) {
69. blow *= 10;
70. blow = blow + b[j] - '0';
71. }
72. }
75. if (c.length() > 9) {
76. for (int j = 0; j < c.length() - 9; j++) {
77. chigh *= 10;
78. chigh = chigh + c[j] - '0';
79. }
80. for (int j = c.length() - 9; j < c.length(); j++) {
81. clow *= 10;
82. clow = clow + c[j] - '0';
83. }
84. }
85. else {
86. chigh = 0;
87. for (int j = 0; j < c.length(); j++) {
88. clow *= 10;
89. clow = clow + c[j] - '0';
90. }
91. }
94. if (Cmp())
95. cout << "Case #" << i + 1 << ": true"<<endl;
96. else
97. cout << "Case #" << i + 1 << ": false"<<endl;
98. }
99. return 0;
100. }

来自为知笔记(Wiz)

转载于:https://www.cnblogs.com/zzandliz/p/5023206.html