/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 13ms 2.82 MiB
#2 Wrong Answer 12ms 2.832 MiB
#3 Accepted 13ms 2.898 MiB
#4 Wrong Answer 12ms 2.68 MiB
#5 Accepted 13ms 2.848 MiB
#6 Wrong Answer 13ms 2.652 MiB
#7 Accepted 13ms 2.777 MiB
#8 Accepted 13ms 2.777 MiB
#9 Accepted 13ms 2.793 MiB
#10 Accepted 13ms 2.777 MiB
#11 Accepted 13ms 2.742 MiB
#12 Accepted 13ms 2.785 MiB
#13 Wrong Answer 13ms 2.777 MiB
#14 Accepted 13ms 2.82 MiB
#15 Accepted 13ms 2.875 MiB
#16 Accepted 13ms 2.758 MiB
#17 Accepted 12ms 2.895 MiB
#18 Accepted 13ms 2.781 MiB
#19 Accepted 13ms 2.902 MiB
#20 Accepted 13ms 2.812 MiB
#21 Wrong Answer 13ms 2.742 MiB
#22 Wrong Answer 12ms 2.895 MiB
#23 Wrong Answer 13ms 2.66 MiB
#24 Accepted 12ms 2.789 MiB
#25 Accepted 13ms 2.836 MiB
#26 Accepted 12ms 2.895 MiB
#27 Accepted 13ms 2.883 MiB
#28 Accepted 13ms 2.801 MiB
#29 Accepted 13ms 2.828 MiB
#30 Accepted 13ms 2.793 MiB
#31 Accepted 13ms 2.758 MiB
#32 Wrong Answer 13ms 2.887 MiB
#33 Accepted 12ms 2.777 MiB
#34 Accepted 12ms 2.887 MiB
#35 Accepted 12ms 2.82 MiB
#36 Accepted 12ms 2.73 MiB
#37 Wrong Answer 13ms 2.809 MiB
#38 Accepted 13ms 2.801 MiB
#39 Accepted 13ms 2.883 MiB

Code

for i in range(int(input())):
  count=0
  Brick=0
  a,b,c,d=map(int,input().split())
  if a==0 and d!=0:
    count = (b * 2) + (c * 3)
    Brick = int(count / 9)
    print(f"Case {i + 1}: {Brick}")
  else:
    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 13:07:12
Judged At
2024-01-09 13:07:12
Judged By
Score
91
Total Time
13ms
Peak Memory
2.902 MiB