QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #786757 | #9738. Make It Divisible | yeVegeTable | WA | 14ms | 10456kb | Python3 | 374b | 2024-11-26 23:18:06 | 2024-11-26 23:18:07 |
Judging History
answer
def solve():
T = int(input())
for _ in range(T):
n, k = map(int, input().split())
a = list(map(int, input().split()))
if len(set(a)) == 1:
# All elements are equal; any x in [1, k] will work
print(k)
else:
# Elements are not all equal; no x will make the array good
print(0)
詳細信息
Test #1:
score: 0
Wrong Answer
time: 14ms
memory: 10456kb
input:
3 5 10 7 79 1 7 1 2 1000000000 1 2 1 100 1000000000
output:
result:
wrong answer 1st lines differ - expected: '3 8', found: ''