Submission #165580

#TimeUsernameProblemLanguageResultExecution timeMemory
165580boolodifjenulaTimovi (COCI18_timovi)Cpython 3
40 / 80
1076 ms6052 KiB
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 timeMemoryGrader output
Fetching results...