CF189A.Cut Ribbon

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

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.

输出格式

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

输入输出样例

输入#1
```
5 5 3 2
```
输出#1
```
2
```
输入#2
```
7 5 5 2
```
输出#2
```
2
```

说明/提示

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.

首页