You are viewing a single comment's thread. Return to all comments →
You're given 4 numbers. The first 3 correspond to the maximum dimensions of a cube. y is the maximum height, x is the maximum width, and z is the maximum depth.
You're supposed to calulate every possible set of dimensions [x,y,z], under the condition that none exceed the input values, and that x+y+z does not add up to n.
thanks that was very helpful!
Thanks for the explanation eric. I've just one more question that in this lexicographic order the last dimension is [1,1,1], but our N is given to be 2. Thus the sum of x+y+z becomes 3 which is greater than N. How is this condition satisfied?? Pls explain.
The only restriction relating to N is that i + j + k != N. i+j+k>N is perfectly valid.
Thanks for your help. Was helpful and appreciate that
Helpful explanation! Thank you
I agree that what you say is the intention of the challenge, But my problem with this challenge is that it never states that X,Y,Z are maximums.
Sample input of 2,2,2 can only be 1 cube with 8 dimensions.
I feel like the statement should be change to express what you are saying, that X,Y,Z correspond to maximum integer dimensions.