Minimum numbers needed to express every integer below N as a sum | Java program to find count of integers needed to express all numbers from 1 to N ; function to count length of binary expression of n ; Driver code
import java . io . * ; class GFG { static int countBits ( int n ) { int count = 0 ; while ( n > 0 ) { count ++ ; n >>= 1 ; } return count ; } public static void main ( String [ ] args ) { int n = 32 ; System . out . println ( " Minimum ▁ value ▁ of ▁ K ▁ is ▁ = ▁ " + countBits ( n ) ) ; } }