Practice Number Systems - Competitive Programming Offered by Unacademy

Number Systems

The total number of bits required to store a number which can have values from 0 to N is

$\lfloor \log_2{N} \rfloor$

$\lceil \log_{2}{(N)} + 1 \rceil$

$\lceil \log_{2}{(N+1) \rceil}$

$\lfloor \log_{2}{(N+1)} + 1 \rfloor$