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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 27 minutes
Notes
not defined yet
Task timeline
Code: 16:33:28 UTC,
java,
autosave
Code: 16:35:14 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.
Code: 16:35:57 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b10000010001
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b1111
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b100000
Code: 16:36:49 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
10000010001
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1111
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
100000
Code: 16:38:26 UTC,
py,
autosave
Code: 16:38:56 UTC,
py,
autosave
# 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
# 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
# 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
# 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
# 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
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 0 expected 5
stdout:
10000010001
1.
0.012 s
OK
stdout:
1111
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 109, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/exec_user_kos3ivag/solution.py", line 19, in solution
return answer
UnboundLocalError: local variable 'answer' referenced before assignment
stdout:
100000
Code: 16:40:08 UTC,
py,
verify,
result: Failed
# 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
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 0 expected 5
stdout:
10000010001 0
1.
0.012 s
OK
stdout:
1111 0
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 109, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/exec_user_99ub3cxb/solution.py", line 19, in solution
print(answer)
UnboundLocalError: local variable 'answer' referenced before assignment
stdout:
100000
Code: 16:40:27 UTC,
py,
autosave
# 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
# 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
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 0 expected 5
stdout:
10000010001 0
1.
0.012 s
OK
stdout:
1111 0
1.
0.012 s
OK
stdout:
100000 0
Code: 16:40:57 UTC,
py,
autosave
# 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
# 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
# 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
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'list'> found.stdout:
10000010001 [0]
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'list'> found.stdout:
1111 [0, 0]
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'list'> found.stdout:
100000 []
Code: 16:41:44 UTC,
py,
autosave
# 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
# 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
# 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
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'list'> found.stdout:
10000010001 1 This i is here.1 0 This i is here!0 0 This i is here!0 0 This i is here!0 0 This i is here!0 0 This i is here!0 1 MAsk over1 0 0 0 1 This i is here.1 [0]
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'list'> found.stdout:
1111 1 This i is here.1 1 MAsk over1 1 This i is here.1 1 MAsk over1 [0, 0]
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'list'> found.stdout:
100000 1 This i is here.1 0 This i is here!0 0 This i is here!0 0 This i is here!0 0 This i is here!0 0 This i is here!0 []
Code: 16:42:31 UTC,
py,
autosave
# 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
# 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
# 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
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'list'> found.stdout:
10000010001 1 This i is here.1 0 This i is here!0 0 0 This i is here!0 0 0 This i is here!0 0 0 This i is here!0 0 0 This i is here!0 0 1 MAsk over1 0 0 0 1 This i is here.1 [0]
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'list'> found.stdout:
1111 1 This i is here.1 1 MAsk over1 1 This i is here.1 1 MAsk over1 [0, 0]
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'list'> found.stdout:
100000 1 This i is here.1 0 This i is here!0 0 0 This i is here!0 0 0 This i is here!0 0 0 This i is here!0 0 0 This i is here!0 0 []
Code: 16:43:13 UTC,
py,
verify,
result: Failed
# 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
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'list'> found.stdout:
10000010001 1 This i is here.1 0 This i is here!0 1 0 This i is here!0 2 0 This i is here!0 3 0 This i is here!0 4 0 This i is here!0 5 1 MAsk over1 0 0 0 1 This i is here.1 [5]
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'list'> found.stdout:
1111 1 This i is here.1 1 MAsk over1 1 This i is here.1 1 MAsk over1 [0, 0]
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'list'> found.stdout:
100000 1 This i is here.1 0 This i is here!0 1 0 This i is here!0 2 0 This i is here!0 3 0 This i is here!0 4 0 This i is here!0 5 []
Code: 16:43:52 UTC,
py,
autosave
# 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
# 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
# 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
Analysis
expand all
Example tests
1.
0.012 s
OK
stdout:
10000010001 1 This i is here.1 0 This i is here!0 1 0 This i is here!0 2 0 This i is here!0 3 0 This i is here!0 4 0 This i is here!0 5 1 MASK over1 0 0 0 1 This i is here.1
1.
0.012 s
OK
stdout:
1111 1 This i is here.1 1 MASK over1 1 This i is here.1 1 MASK over1
1.
0.020 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 109, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/exec_user_cp0vgoip/solution.py", line 26, in solution
answer = max(answer)
ValueError: max() arg is an empty sequence
stdout:
100000 1 This i is here.1 0 This i is here!0 1 0 This i is here!0 2 0 This i is here!0 3 0 This i is here!0 4 0 This i is here!0 5
Code: 16:45:01 UTC,
py,
verify,
result: Passed
# 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
Analysis
expand all
Example tests
1.
0.012 s
OK
stdout:
10000010001 1 This i is here.1 0 This i is here!0 1 0 This i is here!0 2 0 This i is here!0 3 0 This i is here!0 4 0 This i is here!0 5 1 MASK over1 0 0 0 1 This i is here.1
1.
0.012 s
OK
stdout:
1111 1 This i is here.1 1 MASK over1 1 This i is here.1 1 MASK over1
1.
0.012 s
OK
stdout:
100000 1 This i is here.1 0 This i is here!0 1 0 This i is here!0 2 0 This i is here!0 3 0 This i is here!0 4 0 This i is here!0 5
Code: 16:45:18 UTC,
py,
autosave
# 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
# 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
Analysis
expand all
Example tests
1.
0.012 s
OK
stdout:
10000010001 This i is here!0 This i is here!0 This i is here!0 This i is here!0 This i is here!0
1.
0.012 s
OK
stdout:
1111
1.
0.012 s
OK
stdout:
100000 This i is here!0 This i is here!0 This i is here!0 This i is here!0 This i is here!0
Code: 16:45:36 UTC,
py,
verify,
result: Passed
# 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
Analysis
expand all
Example tests
1.
0.012 s
OK
stdout:
10000010001
1.
0.012 s
OK
stdout:
1111
1.
0.012 s
OK
stdout:
100000
Code: 16:45:45 UTC,
py,
verify,
result: Passed
# 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
Analysis
Code: 16:46:25 UTC,
py,
autosave
# 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
# 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
Analysis
Code: 16:46:43 UTC,
py,
verify,
result: Passed
# 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
Analysis
Code: 16:47:33 UTC,
py,
autosave
# 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
# 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
# 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
# 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
# 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
# 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
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 109, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/exec_user_sr9m_6eo/solution.py", line 46, in solution
print(binNun[i:])
NameError: name 'binNun' is not defined
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 109, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/exec_user_sr9m_6eo/solution.py", line 46, in solution
print(binNun[i:])
NameError: name 'binNun' is not defined
1.
0.012 s
OK
Code: 16:49:23 UTC,
py,
autosave
# 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
# 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
# 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
Analysis
Code: 16:52:16 UTC,
py,
autosave
# 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
# 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
User test case 1:
[81]
Analysis
Code: 16:52:40 UTC,
py,
verify,
result: Passed
# 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
User test case 1:
[81]
User test case 2:
[3]
Analysis
Code: 16:52:49 UTC,
py,
autosave
# 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
Code: 16:53:56 UTC,
py,
autosave
Code: 16:54:00 UTC,
py,
verify,
result: Failed
# 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
User test case 1:
[81]
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 1 expected 5
stdout:
12
1.
0.016 s
WRONG ANSWER,
got 1 expected 0
stdout:
5
1.
0.012 s
WRONG ANSWER,
got 1 expected 0
stdout:
7
Code: 16:54:24 UTC,
py,
verify,
result: Failed
# 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
User test case 1:
[81]
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 1 expected 5
stdout:
[2, 8, 12]
1.
0.012 s
WRONG ANSWER,
got 1 expected 0
stdout:
[2, 3, 4, 5]
1.
0.012 s
WRONG ANSWER,
got 1 expected 0
stdout:
[2]
Code: 16:55:11 UTC,
py,
autosave
Code: 16:55:13 UTC,
py,
verify,
result: Failed
# 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)
User test case 1:
[81]
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
[2, 8, 12]
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
[2, 3, 4, 5]
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
[2]
expand all
User tests
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
[2, 4, 8]
Code: 16:55:53 UTC,
py,
autosave
Code: 16:56:03 UTC,
py,
verify,
result: Failed
# 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)
User test case 1:
[81]
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1 1 1 [2, 8, 12]
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1 1 1 1 [2, 3, 4, 5]
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1 [2]
expand all
User tests
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1 1 1 [2, 4, 8]
Code: 16:56:32 UTC,
py,
autosave
Code: 16:56:55 UTC,
py,
autosave
Code: 16:57:04 UTC,
py,
verify,
result: Failed
# 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
User test case 1:
[81]
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.
1.
0.016 s
OK
expand all
User tests
1.
0.016 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, int expected, <class 'NoneType'> found.
Code: 16:57:25 UTC,
py,
autosave
Code: 16:57:41 UTC,
py,
autosave
# 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
# 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
# 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
# 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
# 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
User test case 1:
[81]
Analysis
expand all
Example tests
example1
example test n=1041=10000010001_2
example test n=1041=10000010001_2
✘
RUNTIME ERROR
tested program terminated with exit code 1
tested program terminated with exit code 1
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 109, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/exec_user_1ovnyzmq/solution.py", line 20, in solution
max_dist = max(max_dist, one_idx[i+1] - one_idx[i] +1)
IndexError: list index out of range
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 109, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/exec_user_1ovnyzmq/solution.py", line 20, in solution
max_dist = max(max_dist, one_idx[i+1] - one_idx[i] +1)
IndexError: list index out of range
1.
0.012 s
OK
expand all
User tests
1.
0.012 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 109, in <module>
main()
File "exec.py", line 85, in main
result = solution( N )
File "/tmp/exec_user_1ovnyzmq/solution.py", line 20, in solution
max_dist = max(max_dist, one_idx[i+1] - one_idx[i] +1)
IndexError: list index out of range
Code: 16:59:32 UTC,
py,
autosave
# 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
# 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
# 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
User test case 1:
[81]
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 7 expected 5
1.
0.012 s
WRONG ANSWER,
got 2 expected 0
1.
0.012 s
OK
Code: 16:59:59 UTC,
py,
verify,
result: Passed
# 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
User test case 1:
[81]
Analysis
Code: 17:00:10 UTC,
py,
verify,
result: Passed
# 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
User test case 1:
[81]
Analysis
Code: 17:00:14 UTC,
py,
final,
score:
100
# 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
Analysis summary
The solution obtained perfect score.
Analysis
expand all
Correctness tests
1.
0.012 s
OK
2.
0.012 s
OK
3.
0.012 s
OK
1.
0.012 s
OK
2.
0.012 s
OK
1.
0.012 s
OK
2.
0.012 s
OK
3.
0.012 s
OK
1.
0.012 s
OK
2.
0.012 s
OK
1.
0.012 s
OK
2.
0.012 s
OK
1.
0.012 s
OK
2.
0.012 s
OK
1.
0.012 s
OK
2.
0.012 s
OK
1.
0.012 s
OK
2.
0.012 s
OK
1.
0.012 s
OK
1.
0.012 s
OK
1.
0.012 s
OK
1.
0.012 s
OK
1.
0.012 s
OK
1.
0.012 s
OK
1.
0.012 s
OK