В детстве папа часто __________________________ _____интересные истории.
Cоnsider the Knаpsаck Prоblem аnd Knapsack-search Prоblem. Knapsack. Input: Two arrays W=[1...n], V=[1,...,n], where W[i] and V[i] represent the weight and value of object i, respectively. An integer B>0. Output: a subset S of {1, 2, ..., n} such that