Cut Ribbon
You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.
题目描述
给一长度为n的缎带，要求将其剪成若干长度为a,b,c的缎带，且缎带数量尽可能多。
输入格式
输入仅一行，四个正整数n,a,b,c(n,a,b,c≤4000)。
输出格式
输出仅一行，即缎带数量的最大值。
5 5 3 2
2
7 5 5 2
2