the problem is :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.
and this is its code :
include <stdio.h>
int main()
{
int n,a,b,c,i,j,max=0;
scanf("%d %d %d %d",&n,&a,&b,&c);
for(i=1;i<=n;i++)
{
for(j=1;i*a+j*b<=n;j++)
{
if((n-i*a-j*b)%c==0&&(n-i*a-j*b)/c+i+j>max)
{
max=(n-i*a-j*b)/c+i+j;
}
}
}
printf("%d\n",max);
return 0;
}
What I have tried:
i checked the code in visual studio and the output is correct , but i can't understand what they did in for loop (i*a+j*b) can anyone help please?
Submit an article or tip