There are N heaps of sweets (numbered 1 through N); for each valid i, the i-th of them contains exactly ik sweets. You aim to partition these heaps between you and your friend in such a way that each heap is given to exactly one of you without being split among you. The distribution should be as fair as possible. Formally, let's denote the total number of sweets you get by A and the total number of sweets your friend gets by B; your goal is to minimise JA-BJ. Develop a python code to find the smallest possible value of |A-B|. Sample Input: 1 4 Sample Output: 0001
There are N heaps of sweets (numbered 1 through N); for each valid i, the i-th of them contains exactly ik sweets. You aim to partition these heaps between you and your friend in such a way that each heap is given to exactly one of you without being split among you. The distribution should be as fair as possible. Formally, let's denote the total number of sweets you get by A and the total number of sweets your friend gets by B; your goal is to minimise JA-BJ. Develop a python code to find the smallest possible value of |A-B|. Sample Input: 1 4 Sample Output: 0001
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...
Related questions
Question
Transcribed Image Text:There are N heaps of sweets (numbered 1 through N); for each valid i, the i-th of
them contains exactly ik sweets. You aim to partition these heaps between you and
your friend in such a way that each heap is given to exactly one of you without
being split among you.
The distribution should be as fair as possible. Formally, let's denote the total
number of sweets you get by A and the total number of sweets your friend gets by
B; your goal is to minimise JA-BJ.
Develop a python code to find the smallest possible value of JA-BJ.
Sample Input:
2
1
4
Sample Output:
2
0001
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY