题目解析:
纵向顺序比较,你给出的数必须是已给出的任意两个数的差,且不能与任意一个数相同,如101与42的差是59第一行第一列就是59,那么第二行第一个数就只能是17,但是不能是42或59,因为59和42已经出现过了,以此类推。
思路:
用列表1存放所有已经出现过的数字,列表2存放已经出现的所有数字的差值,然后就能判断出out的那一行,然后每次遇到那一行就continue
输入用例1:
101 42
4 5
59 34 67 9 7
17 9 8 50 7
25 92 43 26 37
76 51 1 41 40
输出1:
Round #4: 1 is out.
Round #5: 3 is out.
Winner(s): 2 4
输入用例2:
42 101
4 5
59 34 67 9 7
17 9 18 50 49
25 92 58 1 39
102 32 2 6 41
输出2:
Round #1: 4 is out.
Round #3: 2 is out.
Round #4: 1 is out.
Round #5: 3 is out.
No winner.
代码:
def ls_out_jude(lst1, k, lst2): # 计算所有的差值
for j in lst1:
lst2.append(abs(j - k))
set(lst2)
return lst2
if __name__ == '__main__':
a, b = map(int, input().split())
n, m = map(int, input().split())
ls_num = [] #存放数字矩阵
lst1 = [a, b] # 存放已经出现的数字
lst2 = [abs(a - b)] # 存放差值
ls_out = [] # 记录out的那一行
for i in range(n):
ls_num.append(list(map(int, input().split())))
for i in range(m):
for j in range(n):
if j in ls_out: # 跳过out的那一行
continue
lst2 = ls_out_jude(lst1, ls_num[j][i], lst2)
if ls_num[j][i] not in lst1 and ls_num[j][i] in lst2:
lst1.append(ls_num[j][i]) # 记录已经出现过的数字
else:
print('Round #{}: {} is out.'.format(i + 1, j + 1))
ls_out.append(j)
if len(ls_out) < n:
print('Winner(s): ', end="")
for i in range(n):
if i not in ls_out:
print(i + 1, end=" ")
else:
print('No winner.')
注:此代码未经提交,仅供参考