dp入门(2)——CF189A.Cut Ribbon(完全背包装满)

//acm入门
//dp完全背包问题

Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions:

After the cutting each ribbon piece should have length a, b or c.
After the cutting the number of ribbon pieces should be maximum.
Help Polycarpus and find the number of ribbon pieces after the required cutting.

Input
The first line contains four space-separated integers n, a, b and c (1 ≤ n, a, b, c ≤ 4000) — the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can coincide.

Output
Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists.

Examples
input
5 5 3 2
output
2
input
7 5 5 2
output
2

Note
In the first example Polycarpus can cut the ribbon in such way: the first piece has length 2, the second piece has length 3.

In the second example Polycarpus can cut the ribbon in such way: the first piece has length 5, the second piece has length 2.

题意：
一根带子可以剪成abc三种长度，尽可能剪成更多份数。
思路：
完全背包问题，将带子的长度看作背包的容量，abc则是可以放入背包的物品，他们的价值都为1，代价分别为abc，同时背包需要装满（划重点）。
第一天刚刚接触dp和背包

	memset