Submission #797728

#	Time	Username	Problem	Language	Result	Execution time	Memory
797728		jackliy369	A Huge Tower (CEOI10_tower)	Cpython 3	0 / 100	1095 ms	72856 KiB

tower

from math import floor, log2, sqrt, log10


N, D = map(int, input().split())
blocks = sorted(list(map(int, input().split())))

for i in range(N):
    for j in range(floor(log2(N))):
        for k in range(1):
            10 + 10

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5