输入第1行给出正整数T(<=10),是测试用例的个数。随后给出T组测试用例,每组占一行,顺序给出A、B和C。整数间以空格分隔。
对每组测试用例,在一行中输出“Case #X: true”如果A+B>C,否则输出“Case #X: false”,其中X是测试用例的编号(从1开始)。
4<br/>1 2 3<br/>2 3 4<br/>2147483647 0 2147483646<br/>0 -2147483648 -2147483647
Case #1: false<br/>Case #2: true<br/>Case #3: true<br/>Case #4: false
k = 0
n = int(input())
for i in range(n):
n = input().split()
s = list(n)
if len(s) == 3:
k+=1
if int(s[0])+int(s[1])>int(s[2]):
print("Case #%d: true"%k)
else:
print("Case #%d: false"%k)
n = eval(input())
for i in range(n):
a, b, c = [eval(i) for i in input().split()]
print('Case #{}: '.format(i + 1), end = '')
print('true') if a + b > c else print('false')
def compareABC(a,b,c,n):
if a+b>c:
print("Case #%d: true"%(n));
else:
print("Case #%d: false"%(n));
n=int(input());
mtr = [[0 for i in range(3)] for i in range(n)];
for i in range(n):
mtr[i]=[int(n) for n in input().split(" ")];
for j in range(n):
compareABC(mtr[j][0],mtr[j][1],mtr[j][2],j+1);
Pyhton版,想了一会!
n = input() array = [] for i in range(n): a, b, c = raw_input().split(" ") array.append([int(a), int(b), int(c)]) for i in range(n): flag = "true" for a in array[i]: if a >= 2**31 and a <= -2**31: flag = "false" if array[i][0] + array[i][1] <= array[i][2]: flag = "false" print "Case #" + str(i + 1) + ": " + flag
t = int(input())
num = []
for i in range(t):
num.append(input().split())
n = 1
for i in num:
if int(i[0])+int(i[1]) > int(i[2]):
print('Case #'+str(n)+': true')
else:
print('Case #'+str(n)+': false')
n += 1
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int i=0; int num=0; long a,b,c; a=0;b=0;c=0; num=sc.nextInt(); while(i++<num){ a=sc.nextLong(); b=sc.nextLong(); c=sc.nextLong(); if((a+b)>c){ System.out.println("Case #"+i+":"+" true"); }else{ System.out.println("Case #"+i+":"+" false"); } } } }一把辛酸泪T_T,没做过OJ的记得java类名为Main,此题大家记得测试的数据定义为long类型,case首字母大写,要与题干要求一致,无力吐槽。。。。