/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 13ms 2.82 MiB
#2 Wrong Answer 12ms 2.898 MiB
#3 Accepted 13ms 2.738 MiB
#4 Accepted 13ms 2.773 MiB
#5 Accepted 13ms 2.883 MiB
#6 Accepted 12ms 2.844 MiB
#7 Accepted 12ms 2.715 MiB
#8 Accepted 12ms 2.68 MiB
#9 Accepted 13ms 2.746 MiB
#10 Accepted 12ms 2.828 MiB
#11 Accepted 12ms 2.742 MiB
#12 Accepted 12ms 2.672 MiB
#13 Wrong Answer 12ms 2.801 MiB
#14 Accepted 12ms 2.883 MiB
#15 Accepted 12ms 2.777 MiB
#16 Accepted 12ms 2.715 MiB
#17 Accepted 12ms 2.832 MiB
#18 Accepted 14ms 2.688 MiB
#19 Accepted 13ms 2.824 MiB
#20 Accepted 13ms 2.887 MiB
#21 Wrong Answer 13ms 2.855 MiB
#22 Wrong Answer 12ms 2.707 MiB
#23 Wrong Answer 12ms 2.902 MiB
#24 Accepted 12ms 2.883 MiB
#25 Accepted 12ms 2.797 MiB
#26 Accepted 15ms 2.891 MiB
#27 Accepted 12ms 2.859 MiB
#28 Accepted 12ms 2.781 MiB
#29 Accepted 12ms 2.727 MiB
#30 Accepted 12ms 2.719 MiB
#31 Accepted 12ms 2.773 MiB
#32 Wrong Answer 12ms 2.766 MiB
#33 Accepted 12ms 2.824 MiB
#34 Accepted 12ms 2.777 MiB
#35 Accepted 12ms 2.777 MiB
#36 Accepted 12ms 2.777 MiB
#37 Wrong Answer 13ms 2.762 MiB
#38 Accepted 12ms 2.777 MiB
#39 Accepted 12ms 2.777 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-01-09 14:04:34
Judged By
Score
93
Total Time
15ms
Peak Memory
2.902 MiB