Cut Ribbon

Cut Ribbon
Time Limit:2000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u

Description

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.

Sample Input

Input
5 5 3 2
Output
2
Input
7 5 5 2
Output
2
开始的时候初始化错误,错了好几次!!!
#include<iostream>
using namespace std;
int max(int a,int b)
{
	return a>b?a:b;
}
int dp[4010];
int main()
{
	int n,a[3];
	int i,j;
	while(cin>>n>>a[0]>>a[1]>>a[2])
	{
		for(i=0;i<=n;i++)
		{
			dp[i]=-4010;
		}
		dp[0]=0;
		for(i=0;i<3;i++)
		{
			for(j=a[i];j<=n;j++)
			{
				dp[j]=max(dp[j],dp[j-a[i]]+1);
			}
		}
		cout<<dp[n]<<endl;
	}
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值