 Necklace splitting problem

The Necklace Splitting Problem is a well-known problem in combinatorial optimization and computer science, particularly in the area of fair division and resource allocation. The problem can be described as follows: Consider a necklace made up of \( n \) different types of beads, where each bead can be seen as a "piece" that has some value.