| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 161437 | boolodifjenula | Go (COCI16_go) | Cpython 3 | 42 ms | 3508 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=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 time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
