Description: Series summation (dynamic programming) given n numbers and a range [x, y], seeking to remove any numbers from these n numbers such that their sum in the range [x, y] how much emulated . Input: input the first acts of integer CASE case < = 10 means that the case set of test data. For each set of test data, the first is an integer n (n < = 30), the second n integers a [i], the third two integers x and y. Wherein a [i]> = 0, the sum (a [i]) < 2 ^ 31,0 <x,y<sum(a[i])< span=""> . </x,y<sum(a[i])<> Output: For each set of data output line, the total number of emulated. Sample Input: 2 3 1 4 1 7 3 1 2 4 2 5 Sample Output: 74
To Search:
File list (Check if you may need any files):
ACM题目：数列求和(动态规划实现).txt
series_sum.cpp
series_sum.py
Download