Test results - Codility

Tasks Details

easy

1. BinaryGap

Find longest sequence of zeros in binary representation of an integer.

Task Score

100%

Correctness

100%

Performance

Not assessed

A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N.

For example, number 9 has binary representation 1001 and contains a binary gap of length 2. The number 529 has binary representation 1000010001 and contains two binary gaps: one of length 4 and one of length 3. The number 20 has binary representation 10100 and contains one binary gap of length 1. The number 15 has binary representation 1111 and has no binary gaps. The number 32 has binary representation 100000 and has no binary gaps.

Write a function:

def solution(N)

that, given a positive integer N, returns the length of its longest binary gap. The function should return 0 if N doesn't contain a binary gap.

For example, given N = 1041 the function should return 5, because N has binary representation 10000010001 and so its longest binary gap is of length 5. Given N = 32 the function should return 0, because N has binary representation '100000' and thus no binary gaps.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..2,147,483,647].

Solution

Programming language used Python

Time spent on task 27 minutes

Notes

not defined yet

Code: 16:33:28 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int N) {
        // Implement your solution here
    }
}

Code: 16:33:39 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    # Implement your solution here
    pass

Code: 16:35:14 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    # Implement your solution here
    pass

The submission is being evaluated.

Code: 16:35:32 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    
    pass

Code: 16:35:57 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    print(bin(N))
    pass

The submission is being evaluated.

Code: 16:36:08 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    
    print(bin(N))
    pass

Code: 16:36:28 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N)
    print(bin(N))
    pass

Code: 16:36:47 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(bin(N))
    pass

Code: 16:36:49 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    pass

The submission is being evaluated.

Code: 16:37:17 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    for i in binNum :
        if i == '1':
            
    pass

Code: 16:37:48 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    for i in binNum :
        check = 0 
    pass

Code: 16:38:11 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #
    pass

Code: 16:38:26 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #bninary gap start 존재
        
    pass

Code: 16:38:56 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #bninary gap start 존재
        if mask ==1 and i =='0':
            count += count
        
    pass

Code: 16:39:07 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            count += count
        
    pass

Code: 16:39:29 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            count += count
        elif i =='1' and mask == 1:
            mask = 0
            #binary gap end 
    pass

Code: 16:39:49 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            count += count
        elif i =='1' and mask == 1:
            mask = 0
            #binary gap end 
            answer =count
    return answer

Code: 16:39:50 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            count += count
        elif i =='1' and mask == 1:
            mask = 0
            #binary gap end 
            answer =count
    return answer

The submission is being evaluated.

Code: 16:40:08 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            count += count
        elif i =='1' and mask == 1:
            mask = 0
            #binary gap end 
            answer =count
    print(answer)
    return answer

The submission is being evaluated.

Code: 16:40:27 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    ans
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            count += count
        elif i =='1' and mask == 1:
            mask = 0
            #binary gap end 
            answer =count
    print(answer)
    return answer

Code: 16:40:30 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = 0
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            count += count
        elif i =='1' and mask == 1:
            mask = 0
            #binary gap end 
            answer =count
    print(answer)
    return answer

The submission is being evaluated.

Code: 16:40:57 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = 0
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            count += count
        elif i =='1' and mask == 1:
            mask = 0
            #binary gap end 
            answer = count
    print(answer)
    return answer

Code: 16:41:14 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = []
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            count += count
        elif i =='1' and mask == 1:
            mask = 0
            #binary gap end 
            answer = count
    print(answer)
    return answer

Code: 16:41:20 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = []
    for i in binNum :
        if i == '1' and mask == 0:
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            count += count
        elif i =='1' and mask == 1:
            mask = 0
            #binary gap end 
            answer.append(count)
    print(answer)
    return answer

The submission is being evaluated.

Code: 16:41:44 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = []
    for i in binNum :
        print(i)
        if i == '1' and mask == 0:
            
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            count += count
        elif i =='1' and mask == 1:
            mask = 0
            #binary gap end 
            answer.append(count)
    print(answer)
    return answer

Code: 16:41:59 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = []
    for i in binNum :
        print(i)
        if i == '1' and mask == 0:
            print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            count += count
        elif i =='1' and mask == 1:
            mask = 0
            #binary gap end 
            answer.append(count)
    print(answer)
    return answer

Code: 16:42:13 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = []
    for i in binNum :
        print(i)
        if i == '1' and mask == 0:
            print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif mask ==1 and i =='0':
            print("This i is here!" + str(i))
            count += count
        elif i =='1' and mask == 1:
            print("MAsk over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    print(answer)
    return answer

The submission is being evaluated.

Code: 16:42:31 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = []
    for i in binNum :
        print(i)
        if i == '1' and mask == 0:
            print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0':
            print("This i is here!" + str(i))
            count += count
        elif i =='1' and mask == 1:
            print("MAsk over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    print(answer)
    return answer

Code: 16:42:43 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = []
    for i in binNum :
        print(i)
        if i == '1' and mask == 0:
            print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            print("This i is here!" + str(i))
            count += count
        elif i =='1' and mask == 1:
            print("MAsk over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    print(answer)
    return answer

Code: 16:43:02 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = []
    for i in binNum :
        print(i)
        if i == '1' and mask == 0:
            print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            print("This i is here!" + str(i))
            count += count
            print(count)
        elif i =='1' and mask == 1:
            print("MAsk over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    print(answer)
    return answer

The submission is being evaluated.

Code: 16:43:13 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = []
    for i in binNum :
        print(i)
        if i == '1' and mask == 0:
            print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            print("This i is here!" + str(i))
            count += 1
            print(count)
        elif i =='1' and mask == 1:
            print("MAsk over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    print(answer)
    return answer

The submission is being evaluated.

Code: 16:43:52 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = []
    for i in binNum :
        print(i)
        if i == '1' and mask == 0:
            print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            print("This i is here!" + str(i))
            count += 1
            print(count)
        elif i =='1' and mask == 1:
            print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    print(answer)
    return answer

Code: 16:44:32 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = []
    for i in binNum :
        print(i)
        if i == '1' and mask == 0:
            print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            print("This i is here!" + str(i))
            count += 1
            print(count)
        elif i =='1' and mask == 1:
            print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    
    return answer

Code: 16:44:37 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = []
    for i in binNum :
        print(i)
        if i == '1' and mask == 0:
            print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            print("This i is here!" + str(i))
            count += 1
            print(count)
        elif i =='1' and mask == 1:
            print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    
    answer = max(answer)
    return answer

The submission is being evaluated.

Code: 16:45:01 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        print(i)
        if i == '1' and mask == 0:
            print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            print("This i is here!" + str(i))
            count += 1
            print(count)
        elif i =='1' and mask == 1:
            print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    
    answer = max(answer)
    return answer

The submission is being evaluated.

Code: 16:45:18 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        print(i)
        if i == '1' and mask == 0:
            print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    
    answer = max(answer)
    return answer

Code: 16:45:27 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    
    answer = max(answer)
    return answer

The submission is being evaluated.

Code: 16:45:36 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    
    answer = max(answer)
    return answer

The submission is being evaluated.

Code: 16:45:45 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    
    answer = max(answer)
    return answer

The submission is being evaluated.

Code: 16:46:25 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
            
    
    answer = max(answer)
    return answer

Code: 16:46:31 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)

            mask = 1
    
    answer = max(answer)
    return answer

The submission is being evaluated.

Code: 16:46:43 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    binNum = bin(N).split("b")[-1]
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)

            
    
    answer = max(answer)
    return answer

The submission is being evaluated.

Code: 16:47:33 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(N):
    binNum = bin(N).split("b")[-1]
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)

            
    
    answer = max(answer)
    return answer

Code: 16:47:49 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def found(new_bin, )

def solution(N):
    binNum = bin(N).split("b")[-1]
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)

            
    
    answer = max(answer)
    return answer

Code: 16:48:05 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def found(new_bin, answer):
    for i in new_bin:
        if i == 

def solution(N):
    binNum = bin(N).split("b")[-1]
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)

            
    
    answer = max(answer)
    return answer

Code: 16:48:26 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def found(new_bin, answer):
    count = 0 
    mask = 0

    for i in new_bin:
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    return answer

def solution(N):
    binNum = bin(N).split("b")[-1]
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)

            
    
    answer = max(answer)
    return answer

Code: 16:48:50 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def found(new_bin, answer):
    count = 0 
    mask = 0

    for i in new_bin:
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    return answer

def solution(N):
    binNum = bin(N).split("b")[-1]
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
            

            
    
    answer = max(answer)
    return answer

Code: 16:49:00 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def found(new_bin, answer):
    count = 0 
    mask = 0

    for i in new_bin:
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    return answer

def solution(N):
    binNum = bin(N).split("b")[-1]
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
            print(binNun[i:])

            
    
    answer = max(answer)
    return answer

The submission is being evaluated.

Code: 16:49:23 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def found(new_bin, answer):
    count = 0 
    mask = 0

    for i in new_bin:
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
    return answer

def solution(N):
    binNum = bin(N).split("b")[-1]
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
            

            
    
    answer = max(answer)
    return answer

Code: 16:50:20 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(N):
    binNum = bin(N).split("b")[-1]
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
            

            
    
    answer = max(answer)
    return answer

Code: 16:50:28 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(N):
    binNum = bin(N)
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
            

            
    
    answer = max(answer)
    return answer

The submission is being evaluated.

Code: 16:52:16 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(N):
    binNum = bin(N)
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
            

            
    
    answer = max(answer)
    return answer

Code: 16:52:18 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(N):
    binNum = bin(N)
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
            

            
    
    answer = max(answer)
    return answer

The submission is being evaluated.

Code: 16:52:40 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(N):
    binNum = bin(N)
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
            

            
    
    answer = max(answer)
    return answer

The submission is being evaluated.

Code: 16:52:49 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(N):
    binNum = bin(N)
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]
    for i in binNum :
        #print(i)
        if i == '1' and mask == 0:
            #print("This i is here." + str(i))
            mask = 1
            #bninary gap start 존재
        elif i =='0'and mask ==1 :
            #print("This i is here!" + str(i))
            count += 1
            #print(count)
        elif i =='1' and mask == 1:
            #print("MASK over" + str(i))
            mask = 0
            #binary gap end 
            answer.append(count)
            

            
    
    answer = max(answer)
    return answer

Code: 16:53:07 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    #print(binNum)
    mask = 0 
    count = 0
    answer = [0]

            

            
    
    answer = max(answer)
    return answer

Code: 16:53:26 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in rangE()

            

            
    
    answer = max(answer)
    return answer

Code: 16:53:56 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == '1':
            one_idx.append(i)
    print(i)

            

            
    
    answer = max(answer)
    return answer

Code: 16:54:00 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == '1':
            one_idx.append(i)
    print(i)

            

            
    
    answer = 1
    return answer

The submission is being evaluated.

Code: 16:54:24 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == '1':
            one_idx.append(i)
    print(one_idx)

            

            
    
    answer = 1
    return answer

The submission is being evaluated.

Code: 16:55:11 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == '1':
            one_idx.append(i)
    print(one_idx)

Code: 16:55:13 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == '1':
            one_idx.append(i)
    print(one_idx)

The submission is being evaluated.

Code: 16:55:53 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == ':
            one_idx.append(i)
    print(one_idx)

Code: 16:56:03 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            print(binNum[i])
            one_idx.append(i)
    print(one_idx)

The submission is being evaluated.

Code: 16:56:32 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            print(binNum[i])
            one_idx.append(i)

Code: 16:56:55 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) == 1

Code: 16:57:04 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
        return 0

The submission is being evaluated.

Code: 16:57:25 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
    # binary gap의 조ㄱ
        return 0

Code: 16:57:41 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
    # binary gap의 조건이 만족되지 않았으면 바로 0 return
        return 0

Code: 16:58:11 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
    # binary gap의 조건이 만족되지 않았으면 바로 0 return
        return 0 
    
    for i in range(0, len(one_idx)):
        answer = max()

Code: 16:58:33 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
    # binary gap의 조건이 만족되지 않았으면 바로 0 return
        return 0 
    
    for i in range(0, len(one_idx)):
        max_dist = max(max_dist, )

Code: 16:58:54 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
    # binary gap의 조건이 만족되지 않았으면 바로 0 return
        return 0 
    
    for i in range(0, len(one_idx)):
        max_dist = max(max_dist, one_idx[i+1] - one_idx[i] +1)

Code: 16:59:06 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []
    max_dist = 0

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
    # binary gap의 조건이 만족되지 않았으면 바로 0 return
        return 0 
    
    for i in range(0, len(one_idx)):
        max_dist = max(max_dist, one_idx[i+1] - one_idx[i] +1)
    return max_dist

The submission is being evaluated.

Code: 16:59:32 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []
    max_dist = 0

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
    # binary gap의 조건이 만족되지 않았으면 바로 0 return
        return 0 
    
    for i in range(1, len(one_idx)):
        max_dist = max(max_dist, one_idx[i+1] - one_idx[i] +1)
    return max_dist

Code: 16:59:42 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []
    max_dist = 0

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
    # binary gap의 조건이 만족되지 않았으면 바로 0 return
        return 0 
    
    for i in range(1, len(one_idx)):
        max_dist = max(max_dist, one_idx[i] - one_idx[i-1] +1)
    return max_dist

Code: 16:59:46 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []
    max_dist = 0

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
    # binary gap의 조건이 만족되지 않았으면 바로 0 return
        return 0 
    
    for i in range(1, len(one_idx)):
        max_dist = max(max_dist, one_idx[i] - one_idx[i-1] +1)
    return max_dist

The submission is being evaluated.

Code: 16:59:59 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []
    max_dist = 0

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
    # binary gap의 조건이 만족되지 않았으면 바로 0 return
        return 0 
    
    for i in range(1, len(one_idx)):
        max_dist = max(max_dist, one_idx[i] - one_idx[i-1] -1)
    return max_dist

The submission is being evaluated.

Code: 17:00:10 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []
    max_dist = 0

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
    # binary gap의 조건이 만족되지 않았으면 바로 0 return
        return 0 
    
    for i in range(1, len(one_idx)):
        max_dist = max(max_dist, one_idx[i] - one_idx[i-1] -1)
    return max_dist

The submission is being evaluated.

Code: 17:00:14 UTC, py, final, score: 100

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

# 81 = 1010001

def solution(N):
    binNum = bin(N)
    one_idx = []
    max_dist = 0

    for i in range(0, len(binNum)):
        if binNum[i] == "1":
            one_idx.append(i)
    
    if len(one_idx) <= 1:
    # binary gap의 조건이 만족되지 않았으면 바로 0 return
        return 0 
    
    for i in range(1, len(one_idx)):
        max_dist = max(max_dist, one_idx[i] - one_idx[i-1] -1)
    return max_dist

The submission is being evaluated.