Problem 2902 · Hard

Count of Sub-Multisets With Bounded Sum

Each distinct value may appear any number of times up to its count; a bounded knapsack counts sums, and zeros multiply the result.

Open the interactive visualisation