Description: At least cost to the problem Description: store all kinds of commodities are denominated. For example, the price of a flower is 2. The price of a flower vase is 5 yuan. In order to attract customers, shops provides a set of preferential commodity prices. Discount merchandise is divided into one or more of a group of commodities and sale. For example, three rather than spend the price of 6 yuan but 5. Two vases of flowers plus a discounted price is 10 yuan. Try to design an algorithm to calculate a customer to buy goods to meet the minimum cost.
- [quanguojiaotongzixun] - solution with the shortest path. For thr
- [shizihebing] - This is a problem on the stones combined
- [PLL] - Abroad, a good digital phase-locked loop
- [hdap] - The activities of the organization of a
- [spglxt] - err
- [spcg] - Points to consider sales and discount sa
- [car] - The use of dynamic programming algorithm
- [qianbi] - Algorithm, coin combinations. Can set th
- [zuishofeiyougouwuwenti] - Each store has a price of goods. For exa
- [suanfa3_1] - Some classic algorithms: including light
File list (Check if you may need any files):
Download