C++ Problem Statement Holi is celebrated in India as a festival of colours and your friend Khan from India has gifted you X packets of colours. Now you are planning to make a beautiful rangoli, to...

Extracted text: C++ Problem Statement Holi is celebrated in India as a festival of colours and your friend Khan from India has gifted you X packets of colours. Now you are planning to make a beautiful rangoli, to make it you need to map all colours pairwise distinct, so that they look attractive. To do so, you can mix the colours zero or more times: o Pick any two random colours. Let's denote their weight by t and u. o Mix the colour with second colour. After the process, the value of the first colour remains t, but the weight of the second colour changes to t + u. Now you have to develop a C++ code to find the minimum number of mixing operations you needs to perform to make a beautiful Rangoli. Sample Test Case Scenario: 5324 Output: