Submission #161438

#TimeUsernameProblemLanguageResultExecution timeMemory
161438boolodifjenulaGo (COCI16_go)Cpython 3
50 / 50
44 ms3404 KiB
n=int(input()) L=[] B=[] maks=0 maksi="" for i in range(n): b=0 L+=[input()] x,y=map(int,input().split()) while y>=x: b+=1 y-=x y+=2 if maks<b: maks=b maksi=L[i] B+=[b] #print(B) print(sum(B)) print(maksi)
#Verdict Execution timeMemoryGrader output
Fetching results...