WeCP Python Coding Question 6 : Help of Prepsters

WeCP Python Coding Question 6 : Help of Prepsters

Problem Statement-:

Arnab has given me a challenge. I have to calculate the number of numbers which are less than a certain value n, and have exactly k set bits in its binary form. As you are a Prepster like me, help me write a code that will take input for n and k and give the expected output.

Constraints :

1<=n<=10000

1<=k<=10

Input Format :

First line containing n and k space separated

Output Format :

Number of numbers present in a single line

Sample Input:

7 2

Sample Output:

Explanation:

011,110,101 -> These three numbers.

Program :

# WeCP Python Coding Question 6 : Help of Prepsters

ans=0

n,k=map(int,input().split())

l=len(bin(n)[2:])

def func(i,s,L):

global l

global ans

if(L>l):

return

if i==0 :

ans+=1

if s!="":

if n<int(s,2):

return

func(i-1,s+"1",L+1)

func(i,s+"0",L+1)

func(k-1,"1",1)

print(ans)

For Output Check the Video :

Comments

Hackerrank Java Coding Questions and Answers - Maximum Passengers

Hackerrank Java Coding Questions and Answers Maximum Passengers Problem Statement -: A taxi can take multiple passengers to the railway station at the same time.On the way back to the starting point,the taxi driver may pick up additional passengers for his next trip to the airport.A map of passenger location has been created,represented as a square matrix. The Matrix is filled with cells,and each cell will have an initial value as follows: A value greater than or equal to zero represents a path. A value equal to 1 represents a passenger. A value equal to -1 represents an obstruction. The rules of motion of taxi are as follows: The Taxi driver starts at (0,0) and the railway station is at (n-1,n-1).Movement towards the railway station is right or down,through valid path cells. After reaching (n-1,n-1) the taxi driver travels back to (0,0) by travelling left or up through valid path cells. When passing through a path cell containing a passenger,the passe...

HackerRank Java Coding Questions and Answers - Disk Space Analysis

HackerRank Java Coding Questions and Answers Disk Space Analysis Problem Statement -: You are given an array, You have to choose a contiguous subarray of length ‘k’, and find the minimum of that segment, return the maximum of those minimums. Sample input 1 → Length of segment x =1 5 → size of space n = 5 1 → space = [ 1,2,3,1,2] 2 3 1 2 Sample output 3 Explanation The subarrays of size x = 1 are [1],[2],[3],[1], and [2],Because each subarray only contains 1 element, each value is minimal with respect to the subarray it is in. The maximum of these values is 3. Therefore, the answer is 3 Program : // Hackerrank Java Coding Questions and Answers // Disk Space Analysis import java.util.*; class DiskSpace { public static void main(String[] args) { Scanner sc=new Scanner(System.in); System.out.println...

TCS CodeVita Coding Questions with Answers - Counting Rock Sample

TCS CodeVita Coding Questions with Answers Counting Rock Sample Problem Description Question – : Juan Marquinho is a geologist and he needs to count rock samples in order to send it to a chemical laboratory. He has a problem: The laboratory only accepts rock samples by a range of its size in ppm (parts per million). Juan Marquinho receives the rock samples one by one and he classifies the rock samples according to the range of the laboratory. This process is very hard because the number of rock samples may be in millions. Juan Marquinho needs your help, your task is to develop a program to get the number of rocks in each of the ranges accepted by the laboratory. Input Format : An positive integer S (the number of rock samples) separated by a blank space, and a positive integer R (the number of ranges of the laboratory); A list of the sizes of S samples (in ppm), as positive integers separated by space R lines where the ith line containing two positive...

Coding Decoding

Search This Blog