Problem Link: SPLITN Problem - CodeChef
Feedback
This problem has not enough number of sample cases given.
Problem Link: SPLITN Problem - CodeChef
This problem has not enough number of sample cases given.
@isthatso10
I think sample test cases and problem statement is quite clear.
The approach is u have to count the number of 1’s in the binary representation of n and then return their count -1.
I said that because you see, you will have to guess and try-hit method to find what might the output be for certain outputs.
I did it.