Giulio is right. Moreover:

"1. The box is 3 dimension : Length x Width X Height = volume, i you
case the length and width are fixed(10 x 100 x h = boxVolume;
boxVolume/ (10/100) = h) "

Is wrong since it's stated that a and b (dimentions of the rectangular
base) aren't fixed, they both belong to [10,100] or (10,100) (can't
see the right operator at forum post)

"3. Minumum number of balls to fit in box = boxVolume/ ballVolume; "

Wrong again since it doesn't care about the minimum number of balls
that fits, it asks to minimize the height of the box that can contain
all. It's stated that balls can have diferent sizes wich means that
the expression isn't right either.

"the problem with balls it NOT so easy as with the boxes"

Even if they were boxes it wouldn't be trivial since itsn't like we
could put any box anywhere provided that they aren't of the same size.

There are two simple ways to solve this. One is elegant and comes from
the subject that address this kind of troubles. The other could be
managed to get an easy to view solution or an efficient one (or both).
Anyways, there isn't point in explain them since you can't even figure
out what's the trouble you got so, in the end, the suggestions are:

1) Ask your teacher.

2) Remake and post somewhere else. Try to make it look more like a
challenge and less like an academic homework. You can see that not
long ago someone posted here something like "solve this if you can"
and his trouble was solved very fast. (not saying that it's fine, I
get mad when I see such things, not in the mood to argue though)

On 21 ago, 09:03, Giulio Bellezza <[email protected]> wrote:
> "...Every ball can taken a certain amount of this volume, the smallest box
> that each ball can fit could be a box with 2r x 2r x 2r (r = radius of
> the ball, d = 2r where d =dimeter, ballVolume = dxdxd = ballVolume)...."
>
> This is NOT correct. The ball is different than the box. The ball can go 
> "between" other ball... I think the problem with balls it NOT so easy as with 
> the boxes
>
> --- Ven 21/8/09, Kaka madiba <[email protected]> ha scritto:
>
> Da: Kaka madiba <[email protected]>
> Oggetto: [java programming] Re: Please Help me Out...
> A: "Free Java Programming Online Training Course By Sang Shin" 
> <[email protected]>, 
> [email protected]
> Data: Venerdì 21 agosto 2009, 06:42
>
> I believe this is a homework for you and the best way to do academic stuff is 
> to do them yourself so that your rightfully deserve the score. The only thing 
> than I may help which I feel is in good direction is to give you just the 
> tips (Algorithm):
>  
> 1. The box is 3 dimension : Length x Width X Height = volume, i you case the 
> length and width are fixed(10 x 100 x h = boxVolume; boxVolume/ (10/100) = h)
> 2. Every ball can taken a certain amount of this volume, the smallest box 
> that each ball can fit could be a box with 2r x 2r x 2r (r = radius of the 
> ball, d = 2r where d =dimeter, ballVolume = dxdxd = ballVolume).
> 3. Minumum number of balls to fit in box = boxVolume/ ballVolume;
>  
> Good day, I believe you can improve this algorithm to turn into good code.
>  
> Good day
>  
> Gerald
>
> --- On Thu, 8/20/09, JAVA PROGRAMMER <[email protected]> 
> wrote:
>
> From: JAVA PROGRAMMER <[email protected]>
> Subject: [java programming] Please Help me Out...
> To: "Free Java Programming Online Training Course By Sang Shin" 
> <[email protected]>
> Date: Thursday, August 20, 2009, 10:08 AM
>
> here's the program...
> please give me the program...its very very urgent..
> and please do explain me what does the program wanna say and what does
> it want from a programmer...
>
> Suppose we have a set of balls and a large cuboid box, with a
> rectangle as its base. The box has a fixed size at the base, but we
> can choose its height. We would like to place all the balls within the
> box, and at the same time try to minimize its height.
> Input
>
> First, 2 integers, 10 a,b 100 - the dimensions of the rectangular base
> of the box. Then, an integer 1 n 10000, representing the number of
> balls. The following n values 1 ri 5 are the radii of the respective
> balls.
> Output
>
> You should write to output n triples of floating-point numbers, the
> ith triple being the x,y, and z coordinates of the center of the ith
> ball.
> If we want to be precise, the coordinates of the points written to
> output
>  must fulfill the following constraints for the i-th point: xi-
> ri 0, yi-ri 0, zi-ri 0, xi+ri a, yi+ri b. Moreover, for each i j, (xi
> - xj)2 + (yi - yj)2 + (zi - zj)2 (ri + rj)2 (no two balls are allowed
> to overlap).
> Scoring
>
> The goal is to minimize the height h of the box, where h = maxi (zi
> +ri). For each data set, your program will be scored by the proportion
> of the box volume actually used by the balls:
> score = 4/3* *(r13+..+rn3)/(a*b*h).
> The program is run independently for a number of data sets, and the
> displayed score is the mean of scores obtained for individual data
> sets.
> Example
>
> Input:
> 5 5
> 2
> 1.0
> 2.0
>
> Output:
> 4.0 4.0 3.0
> 2.0 2.0 2.0
>
> Score:
> 37.6991118/100.0 = 0.376991118
>
> thanx in advance !!!
>
> Regards,
> Java Programmer.

--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to 
[email protected]
For more options, visit this group at 
http://groups.google.com/group/javaprogrammingwithpassion?hl=en
-~----------~----~----~----~------~----~------~--~---

Reply via email to