# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165580 | boolodifjenula | Timovi (COCI18_timovi) | Cpython 3 | 1076 ms | 6052 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
N,K,M=map(int,input().split())
L=N*[0]
i=-1
k=1
while M>0:
if k: i+=1
else: i-=1
if M>K:
L[i]+=K
M-=K
else:
L[i]+=M
M=0
break
if i==N-1:
k=0
if i==0:
k=1
for j in range(N): print(L[j],end=" ")
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |