Problem D. Greatest Input file: Output file: standard input standard output 2 seconds Time limit: Memory limit: 64 megabytes You are given an even number N and an integer K and you have to find the greatest odd number M less than N such that the sum of digits in binary representation of M is at most K. Input 2 numbers. Output 1 number Examples standard input standard output 10 2 25 1 Note For case when N = 10, K = 2. Binary representation of 10 is 1010 and binary representation of 9 is 1001, hence greatest odd number less than 10 whose sum of digits in its binary representation is at most 2 is 9. Hence output is 9.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%
Problem D. Greatest
Input file:
Output file:
standard input
standard output
Time limit:
2 seconds
Memory limit:
64 megabytes
You are given an even number N and an integer K and you have to find the greatest odd number M less
than N such that the sum of digits in binary representation of M is at most K.
Input
2 numbers.
Output
1 number
Examples
standard input
standard output
10 2
25
Note
For case when N = 10, K = 2. Binary representation of 10 is 1010 and binary representation of 9 is 1001,
hence greatest odd number less than 10 whose sum of digits in its binary representation is at most 2 is 9.
Hence output is 9.
Transcribed Image Text:Problem D. Greatest Input file: Output file: standard input standard output Time limit: 2 seconds Memory limit: 64 megabytes You are given an even number N and an integer K and you have to find the greatest odd number M less than N such that the sum of digits in binary representation of M is at most K. Input 2 numbers. Output 1 number Examples standard input standard output 10 2 25 Note For case when N = 10, K = 2. Binary representation of 10 is 1010 and binary representation of 9 is 1001, hence greatest odd number less than 10 whose sum of digits in its binary representation is at most 2 is 9. Hence output is 9.
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY