We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Python
  3. Basic Data Types
  4. List Comprehensions
  5. Discussions

List Comprehensions

  • Tsean + 1 comment

    Can anybody make me understand this question ? I went through few comments what this question all about but still I'm not clear Please help

    • eric2013Asked to answer + 4 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.

      • steeeenos + 0 comments

        thanks that was very helpful!

      • shashanksaurav41 + 1 comment

        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.

        • eric2013 + 1 comment

          The only restriction relating to N is that i + j + k != N. i+j+k>N is perfectly valid.

          • shashanksaurav41 + 0 comments

            Thanks for your help. Was helpful and appreciate that

      • sawani_soman92 + 0 comments

        Helpful explanation! Thank you

      • dng304 + 0 comments

        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.