Got the idea but cannot write in code... help me

[u4722839]

Question: Suppose you are given a gift voucher worth $100. Assuming that the shop does not give change on gift voucher and you do not wish to spend any more than what is in the gift voucher. This means for example:

if there are items $87, $20, $99, $12 then the most I can spend is $100 since
buying 4 $20 item.

I have wrote some of the codes but...stuck.

public class lab233 {
	static int voucherMoney = 100;
	static int item1 = 23;
	static int item2 = 38;
	static int item3 = 40;
	static int item4 = 58;
	
	static int a = voucherMoney/item1; 
//by dividing most no of this items can be bought
	static int b = voucherMoney/item2; 
	static int c = voucherMoney/item3;
	static int d = voucherMoney/item4;

	
	public static void main(String[] args){
		for(int i = 0; i < a; i++){
			for(int j = 0; j < b; j++){
				for(int k = 0; k < c; k++){
					for(int g = 0; g < d; g++){
				//I think by using 4 loops and compare the combinations.... by using compareTo methods??? help me here T.T					                      }
				}
			}
		}
	}
}

[JosAH]

if there are items $87, $20, $99, $12 then the most I can spend is $100 since
buying 4 $20 item.

4x20 == 80. Your problem is a knapsack problem and google is your friend here.

kind regards,

Jos

[u4722839]

5 $20 my bad lol thanks!..hmm.. how should i type..to find out the model solution for this then?

[JosAH]

5 $20 my bad lol thanks!..hmm.. how should i type..to find out the model solution for this then?

As I wrote: google for "knapsack problem"; I also wrote a complete code solution for this nasty little problem in this forum once; maybe the seach facility can find it for you.

kind regards,

Jos

[u4722839]

I search for the google and saw your example but I cannot apply to this situation... can you help me directly here???? anyone?

[JosAH]

I search for the google and saw your example but I cannot apply to this situation... can you help me directly here???? anyone?

Why do you think my solution can't be applied to your 'situation'?

kind regards,

Jos

[u4722839]

I think my brain is dead right now :).... cannot understand the algorithm probably hww..;;

[JosAH]

I think my brain is dead right now :).... cannot understand the algorithm probably hww..;;

From your OP:

if there are items $87, $20, $99, $12 then the most I can spend is $100

So you have to fill a knapsack of 'size' 100 given the items: 87, 20, 20, 20, 20, 20, 99, 12, 12, 12, 12, 12, 12, 12, 12

kind regards,

Jos

[u4722839]

hmm................I think I should give up... cannot write the code... T.T among those values how can I get the maximum combination that is equalto or less than $100... the combination............hmm..

[JosAH]

hmm................I think I should give up... cannot write the code... T.T among those values how can I get the maximum combination that is equalto or less than $100... the combination............hmm..

Yes, you'd better give up; I spelled it almost out for you, you found my code on this forum and I gave you the way to use it for your 'situation'; how much more spoonfeeding do you need?

kind regards,

Jos

[gomdohri]

wa.. how do i do this??????????????????????????????

[Junky]

Try adding a few more question marks. I'm sure that will convince someone to write the code for you.