제출 #161437

#제출 시각아이디문제언어결과실행 시간메모리
161437boolodifjenulaGo (COCI16_go)Cpython 3
0 / 50
42 ms3508 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...