C++ Programming Problem: Kelvin and Fahrenheit have gotten bored of eating ice cubes, so now they have candies instead. Kelvin has X hot candies, and Fahrenheit has Y cold candies. K always want the split of candies to be as fair as possible. The problem is, Kelvi candies and Fahrenheit only wants cold candies. Here comes Equilibrium to th hought an infinite number of candy packs. There are two types of packs: Packs

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

 

#9&

 

C++ Programming Problem:
Kelvin and Fahrenheit have gotten bored of eating ice cubes, so now they have decided to eat
candies instead. Kelvin has X hot candies, and Fahrenheit has Y cold candies. Kelvin and Fahrenheit
always want the split of candies to be as fair as possible. The problem is, Kelvin only wants hot
candies and Fahrenheit only wants cold candies. Here comes Equilibrium to the rescue! Equilibrium
bought an infinite number of candy packs. There are two types of packs: Packs containing exactly C
hot candies and Packs containing exactly D cold candies.
Equilibrium wants to give some hot candy packs to Kelvin and some cold candy packs to Fahrenheit
in such a way that the absolute difference between the number of candies they have is minimized.
You are assigned to develop a C++ code that finds out the minimum absolute difference.
Test Case
1
1222
Result
1
Transcribed Image Text:C++ Programming Problem: Kelvin and Fahrenheit have gotten bored of eating ice cubes, so now they have decided to eat candies instead. Kelvin has X hot candies, and Fahrenheit has Y cold candies. Kelvin and Fahrenheit always want the split of candies to be as fair as possible. The problem is, Kelvin only wants hot candies and Fahrenheit only wants cold candies. Here comes Equilibrium to the rescue! Equilibrium bought an infinite number of candy packs. There are two types of packs: Packs containing exactly C hot candies and Packs containing exactly D cold candies. Equilibrium wants to give some hot candy packs to Kelvin and some cold candy packs to Fahrenheit in such a way that the absolute difference between the number of candies they have is minimized. You are assigned to develop a C++ code that finds out the minimum absolute difference. Test Case 1 1222 Result 1
Expert Solution
steps

Step by step

Solved in 3 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