/* laundry-bot [challenge] You have created a revolutionary machine which collects dirty laundry at the top and washes, tidys, sorts it and finally places it at the bottom. In the process of sock-washing you come to a problem: sorting two belonging socks together. The machine has a build in AI to give a sock a numberical value which is unique for that type of sock. Every sock is seperate in a small chamber inside the machine. You have to create a small subprogram which takes as an input an Array of chambers with socks inside and outputs an array of pairs(array of the two indexes) and an array of socks which don't have a partner(also the indexes). Things you may assume (but don't have to): -a sock has at most only 1 partner -the numerical value the AI gives a sock is in the range 0-255 (both included) Examples: Input: [2, 6, 6, 1, 2, 1] Output: [[0, 4], [1, 2], [3, 5]] [] Input: [1, 4, 2] Output: [] [0, 1, 2] Input: [3, 1, 4, 1, 5, 5] Output: [[1, 3], [4, 5]] [0, 2] now the machine can join those chanbers https://www.sololearn.com/post/210671/?ref=app */ #include #include #include #include using namespace std; auto Display_pairs = [](auto&& pairs){ stringstream wp,np; wp << "["; np << "["; for(auto&&[key,value] : pairs) if(value.size()>1) wp << "[" << *begin(value) << ',' << *next(begin(value)) << ']' << ','; else np << *begin(value) <<','; wp << ']'; np << ']'; cout << wp.str() << " " << np.str() << "\n\n"; }; auto Process_chambers = [](auto&& chambers){ map> socks; for(size_t i=0; i

[Challenge]Laundry_bot.cpp