/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 14ms 2.949 MiB
#2 Wrong Answer 14ms 2.961 MiB
#3 Accepted 14ms 3.105 MiB
#4 Accepted 14ms 3.02 MiB
#5 Accepted 14ms 3.039 MiB
#6 Accepted 14ms 2.922 MiB
#7 Accepted 14ms 3.027 MiB
#8 Accepted 14ms 3.004 MiB
#9 Accepted 14ms 3.0 MiB
#10 Accepted 14ms 3.121 MiB
#11 Accepted 14ms 3.07 MiB
#12 Accepted 14ms 3.082 MiB
#13 Wrong Answer 14ms 3.031 MiB

Code

t = int(input())
if 1 <= t <= 10:
    for i in range(t):
        count = 0
        Brick = 0
        a, b, c, d = map(int, input().split())
        if 0<=a<=40 and 0<=b<=40:
            if 0 <= c <= 40 and 0 <= d <= 40:
                count = (a * 1) + (b * 2) + (c * 3) + (d * 3)
                Brick = int(count / 9)
                print(f"Case {i + 1}: {Brick}")

Information

Submit By
Type
Submission
Problem
P1014 FIFA World Cup 2022 Again!
Language
Python 3 (Python 3.12.3)
Submit At
2024-01-09 14:04:34
Judged At
2024-11-11 03:43:38
Judged By
Score
11
Total Time
14ms
Peak Memory
3.121 MiB