답안 #161438

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161438 2019-11-02T14:20:21 Z boolodifjenula Go (COCI16_go) Python 3
50 / 50
44 ms 3404 KB
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)
    
    
    

    
# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3300 KB Output is correct
2 Correct 25 ms 3300 KB Output is correct
3 Correct 25 ms 3300 KB Output is correct
4 Correct 26 ms 3272 KB Output is correct
5 Correct 25 ms 3300 KB Output is correct
6 Correct 26 ms 3300 KB Output is correct
7 Correct 26 ms 3272 KB Output is correct
8 Correct 26 ms 3300 KB Output is correct
9 Correct 27 ms 3304 KB Output is correct
10 Correct 25 ms 3300 KB Output is correct
11 Correct 26 ms 3304 KB Output is correct
12 Correct 25 ms 3300 KB Output is correct
13 Correct 27 ms 3300 KB Output is correct
14 Correct 25 ms 3300 KB Output is correct
15 Correct 25 ms 3300 KB Output is correct
16 Correct 26 ms 3300 KB Output is correct
17 Correct 25 ms 3300 KB Output is correct
18 Correct 25 ms 3300 KB Output is correct
19 Correct 44 ms 3404 KB Output is correct
20 Correct 26 ms 3300 KB Output is correct
21 Correct 26 ms 3300 KB Output is correct
22 Correct 27 ms 3272 KB Output is correct
23 Correct 27 ms 3300 KB Output is correct
24 Correct 27 ms 3304 KB Output is correct
25 Correct 26 ms 3300 KB Output is correct