We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Day 10: Binary Numbers
Day 10: Binary Numbers
Sort by
recency
|
2818 Discussions
|
Please Login in order to post a comment
python 3
def base2(n):
Pyhton
n = int(input())
binary_representation = bin(n)[2:]
consecutive_ones = binary_representation.split('0')
max_consecutive_ones = max(len(group) for group in consecutive_ones)
print(max_consecutive_ones)
My C# solution
public static void Main(string[] args) { int n = Convert.ToInt32(Console.ReadLine().Trim());
import math import os import random import re import sys
def intoBinary(number): binarynumber="" if (number!=0): while (number>=1): if (number %2==0): binarynumber=binarynumber+"0" number=number/2 else: binarynumber=binarynumber+"1" number=(number-1)/2 else: binarynumber="0" return "".join(reversed(binarynumber))
def count_consecutive(bin_num): count=0 flag=0 max_count=-1 for i in range(len(bin_num)): if bin_num[i]=='1': flag=1 else: flag=0 if flag==1: count+=1
if (flag==0) or (i==len(bin_num)-1): if max_count
if name == 'main': n = int(input().strip()) #print(intoBinary(n)) #print(intoBinary(125)) count_consecutive(intoBinary(n))
Python 3 code
import math import os import random import re import sys
if name == 'main': n = int(input().strip()) binary = bin(n)[2:] print(len(max(binary.split("0"))))