Cut Ribbon
来源:互联网 发布:苏格兰折耳猫 知乎 编辑:程序博客网 时间:2024/05/21 06:53
Cut Ribbon
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uDescription
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 andc (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 numbersa, b andc 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;}}
- Cut Ribbon
- Cut Ribbon
- Cut Ribbon
- A. Cut Ribbon
- codefroces A. Cut Ribbon
- CF cut ribbon
- Cut Ribbon codeforce
- CF - 189A - Cut Ribbon
- CF 189A Cut Ribbon
- CF 189 A Cut Ribbon
- D - Cut Ribbon (dp)
- codeforces 189A Cut Ribbon
- CodeForces 189A Cut Ribbon
- CodeForces 189A-Cut Ribbon
- CF 189A Cut Ribbon
- codeforces 189A. Cut Ribbon
- CodeForces 189A Cut Ribbon
- Codeforces189 A. Cut Ribbon(DP)
- android 如何预置APK
- nyoj 82 迷宫寻宝(一)
- S2JDBC tutorial project
- HDU 4544
- MFC创建模态对话框
- Cut Ribbon
- 动态构造 lambda
- C#利用lambda表达式将函数作为参数或属性跨类传递
- Hat’s Words(hdu1247字典树)
- Linux下模块化编程生成函数库和编译方法
- ResearchGate
- Burning Midnight Oil
- nyoj 84 阶乘的0
- JAVA基础 (一) 并发 ThreadLocal与Synchronized 用哪一个好