PAT-1065 A+B and C (64bit) 解答(with python)

1.Description:

 

2.Example:

Input:
3
1 2 3
2 3 4
9223372036854775807 -9223372036854775808 0
Output:
Case #1: false
Case #2: true
Case #3: false

3.solutions:

 1 """
 2     created by sheepcore on 2020-03-01
 3 """
 4 
 5 if __name__ == "__main__":
 6     size = eval(input())
 7     cases = []
 8     i = 0
 9     while i < size:
10         cases.append(input().split())
11         i += 1
12     j = 1
13     for case in cases:
14         if eval(case[0]) + eval(case[1]) > eval(case[2]):
15             print("Case #" + str(j) + ": " + "true")
16         else:
17             print("Case #" + str(j) + ": " + "false")
18         j += 1
原文地址:https://www.cnblogs.com/sheepcore/p/12391634.html