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....

Extracted 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 Result 1 1222