Count the 1s in the binary representation

PKJ

 Coding Problem Keys 

 Count the 1s in the binary representation 

 Problem Statement 

A positive integer N is passed as the input. The program must print the number of 1s in the binary representation of N.

 Boundary Condition(S) 

1 <= N <= 9000000000000000000

 Input Format 

The first line will contain the value of N.

 Output Format 

The first line will contain the count of 1s in their binary representation.

 Example Input/Output 1 

 Input 

22

 Output 

3

 Note: Max Execution Time Limit: 5000 millisecs 

 Solution 

 Programming Language: Python 3 Language 

print(bin(int(input()))[2:].count('1'))

# Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Anonymous said…
this program is not compiling....

File "Hello.py", line 1 in
print(bin.......)))

TypeError: 'int' object is not subscriptable
December 23, 2021 at 6:23 AM
PKJ said…
Thank You for your assist.
-PKJCODERS Admin
December 23, 2021 at 7:27 AM
Post a Comment

Popular Posts

Top Scoring Batsman - TEST ODI 20-20

PKJ
 Coding Problem Keys   Top Scoring Batsman - TEST ODI 20-20   Problem Statement  The program must accept the runs scored by N batsmen in the various cricket formats - TEST, ODI and 20-20 and print the top scoring batsman.     - In case two batsmen have scored same total runs, consider TEST cricket runs. The batsman who has scored higher runs in TEST cricket is the top scoring batsman.     - In case two batsmen have scored same total runs and have TEST cricket runs equal, consider ODI runs.     - In case two batsmen have scored same total runs and have TEST and ODI runs equal, consider 20-20 runs.  Boundary Condition(s)  1 <= N <= 20  Input Format  The first line contains the value of N. N lines follow with each line containing Batsman Name and runs in TEST, ODI and 20-20 runs (the values are separated by a space).  Output Format  The first line contains the name of the top Scoring Batsman. ...
Click to Continue...

Largest Possible Number With Digits

PKJ
 Coding Problem Keys   Largest Possible Number With Digits   Problem Statement  A number N is passed as the input. The program must print the largest possible number with the digits in the given number N.  Boundary Condition(S)  1 <= N <= 9999999  Input Format  The first line contains the value of N .  Output Format  The first line contains the largest possible number with the digits in N.  Example Input/Output 1   Input  265  Output  652  Example Input/Output 2   Input  9090  Output  9900  Example Input/Output 3   Input  222  Output  222  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  print (* sorted ( input ().strip())[::- 1 ],sep= "" ) # Published By PKJCODERS  ( Note:  Incase If the code doesn't Pass the output kindly comment us with you...
Click to Continue...

Highly Profitable Months

PKJ
 Coding Problem Keys   Highly Profitable Months   Problem Statement  The stocks of a company are being surveyed to analyse the net profit of the company over a period of several months. For an analysis parameter k, a group of k consecutive months is said to be highly profitable if the values of the stock prices are strictly increasing for those months. Given the stock prices of the company for n months and the analysis parameter k, find the number of highly profitable months  Example  Let the number of months be n = 8, the stock prices be stockPrices = [5, 3, 5, 7, 8] and the analysis parameter be k = 3. Following are the groups of k months in which the stock prices are strictly increasing: Hence the answer is 2.  Function Description  Complete the function countHighlyProfitableMonths in the editor below. countHighlyProfitableMonths has the following parameters:     int stockPrices[n]: the stock prices for n months.   ...
Click to Continue...

Minimum Sum of Non-Negative Elements

PKJ
 Coding Problem Keys   Minimum Sum of Non-Negative Elements   Problem Statement  Given a non-negative integer array Arr having size N. Each element of the array will carry a different value. This means no two elements can have the same values. The candidate has to do this with minimal changes in the original value of elements, making every element as least as much value as it originally had. Find the minimum sum of all the elements that can be set the array for.  Input Format  First Input Line: Accept a single positive integer value for N representing the size of Arr[] . Second Input Line: Accept the N number of integer values separated by a new line, representing the original values assigned to each element.  Output Format  The output must be a non-negative integer only (See the output format in examples) . Violation of Input Criteria: System should display a message as a "Wrong Input" . Additional messages in the output will resu...
Click to Continue...

Count Embedded Integers in String

PKJ
 Coding Problem Keys   Count Embedded Integers in String    Problem Statement  A string is passed as input. The program must print the count of integers present in the string.  Boundary Condition(s)  1 <= Length of string <= 1000  Input File Format  The first line contains the string.  Output File Format The first line contains the count of integers.  Example Input/Output 1   Input  bingo123alpha56beta  Output  2  Explanation  The two integers are 123 and 56.  Example Input/Output 2   Input  73dknj99ff8we99  Output  4  Explanation  The four integers are 73, 99, 8 and 99.  Note:  Max Execution Time Limit: 5000 millisecs   S olution   Programming Language: C Language  #include<stdio.h> #include <stdlib.h> int main (){ char s[ 1000 ]; scanf( "%s" , s); int count = 0 , counter = ...
Click to Continue...

String - Vowels Position Sum

PKJ
 Coding Problem Keys   String - Vowels Position Sum   Problem Statement  The string S is accepted as the input. The program must print the sum of the positions of the vowels in S. If the string does not contain any vowels then print -1 .  Boundary Condition(s)  2 <= Length of the string S <= 100  Input Format  The first line contains the value of String S.  Output Format  The first line contains the sum of the positions of the vowels in S.  Example Input/Output 1   Input  nose   Output  6   Explanation  The vowels in the string are o and e . The position of o is 2 and the position of e is 4. The sum of the positions = 2 + 4 = 6. Hence the output is 6 .  Example Input/Output 2   Input  xyz  Output  -1   Explanation  There are no vowels in the given string S. Hence the output is -1 .  Max Execution Time Limit: 5000 millisecs   So...
Click to Continue...

Desktop Products

PKJ
 Coding Problem Keys   Desktop Products   Problem Statement  A company DigiComparts manufactures 52 types of unique products for laptop and desktop computers. It manufactures 10 types of laptop products and 42 types of desktop products. Each product manufactured by the company has a unique productID from a-z and and A-Z. The laptop products have productIDs (a, i, e, o, u, A, I, E, O, U) while the rest of the productIDs are assigned to the desktop products. The company manager wishes to find the sales data for the desktop products. Given a list of productIDs of the sales of the last N products, write an algorithm to help the manager find the productIDs of the desktop products.  Input Format  The first line of the input consists of an integer numOfProducts, representing the number of products to be considered in the sales data (N). The second line consists of N space-separated characters - productID 1 , productID 2 , ... , productID N  represen...
Click to Continue...