QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#566316 | #9308. World Cup | nanqcq# | WA | 10ms | 10732kb | Python3 | 531b | 2024-09-15 23:48:20 | 2024-09-15 23:48:20 |
Judging History
answer
import sys
import math
def main():
import sys
input = sys.stdin.read
data = input().split()
t = int(data[0])
index = 1
for _ in range(t):
a = list(map(int, data[index:index+32]))
index +=32
sorted_a = sorted(a, reverse=True)
chinese_strength = a[0]
R = sorted_a.index(chinese_strength) +1
# Find the smallest power of two >= R
p =1
while p < R:
p *=2
print(p)
if __name__ == "__main__":
main()
详细
Test #1:
score: 100
Accepted
time: 8ms
memory: 10644kb
input:
1 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1
output:
1
result:
ok 1 number(s): "1"
Test #2:
score: -100
Wrong Answer
time: 10ms
memory: 10732kb
input:
32 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 2 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 3 1 2 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 4 1 2 3 5 6 7 8 9 10 11 12 13 14 15 ...
output:
32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 16 16 16 16 16 16 16 16 8 8 8 8 4 4 2 1
result:
wrong answer 3rd numbers differ - expected: '16', found: '32'