24:I[91452,["/_next/static/chunks/f915c07274536659.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/b100b36337f58b96.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/44f9947f31017eda.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/1f34752723866743.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/06238a0ba6e2450a.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/1fe50d1faa3d3f5b.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/a068ae4bba82be06.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp","/_next/static/chunks/135849583f9affe4.js?dpl=dpl_6MnXruQRBVToNztnTT8CLMLZMzdp"],"ProblemHintSolution"] 23:T471,

100

children stand in a line each having

100

candies. In one move, one of them may take some of their candies and distribute them to a non-empty set of the remaining children. After what least number of moves can it happen that no two children have the same number of candies?
(N. Chernyatevya)
(Translated from [url=http://sasja.shap.homedns.org/Turniry/TG/index.html]here.)

Problem Statement