There are N<=200 containers and M<=100 type of objects. For each type of object are exactly Xi<=100 objects, each type of bject has a value Vi <= 100. You could put any of the total number of objects into the containers. After that, the value of a container is the total value of all objects in that container. You need to give a repartition with minimun difference of values between any two containers.

Can someone tell me what style of contest is this?