11631 | 2024-11-02 09:52:49 | MagyarKendeSZLG | Farmula 1 | python3 | Accepted 100/100 | 45ms | 3320 KiB |
S = [25, 18, 15, 12, 10, 8, 6, 4, 2, 1, 0]
T = int(input())
for _ in range(T):
N = int(input())
P = list(map(int, input().split()))
print("Champion" if
sum([S[min(x - 1, 10)] for x in P]) >=
18 * P.count(1) + 25 * (N - P.count(1))
else "Practice harder")
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
subtask1 | 0/0 | ||||||
1 | Accepted | 14ms | 2872 KiB | ||||
subtask2 | 20/20 | ||||||
2 | Accepted | 21ms | 3128 KiB | ||||
3 | Accepted | 23ms | 3128 KiB | ||||
subtask3 | 20/20 | ||||||
4 | Accepted | 45ms | 3204 KiB | ||||
5 | Accepted | 43ms | 3128 KiB | ||||
6 | Accepted | 43ms | 3128 KiB | ||||
7 | Accepted | 35ms | 2928 KiB | ||||
subtask4 | 60/60 | ||||||
8 | Accepted | 43ms | 3320 KiB | ||||
9 | Accepted | 45ms | 2984 KiB | ||||
10 | Accepted | 43ms | 3092 KiB | ||||
11 | Accepted | 32ms | 3024 KiB |