Statistics

Problem Statement for "PaperFold"

Problem Statement

You have a piece of paper that you need to fold to fit into a box with a given width and length. Each time you fold the paper, you can fold it in half across either its width or length, but you can only fold the paper 8 times (after 8 times, the paper is too dense to fold again).

You will be given a int[] paper, which contains the width and length of the paper in inches, and a int[] box, which contains the width and length of the box in inches. In both cases, the first element is the width and the second element is the length. Your method should return the fewest number of folds which would allow you to fit the paper into the box. You can rotate the paper 90 degrees if it will fit with fewer folds, but the paper must lie completely flat inside the box. If the paper cannot be fit into the box with 8 folds or fewer, return -1.

Definition

Class:
PaperFold
Method:
numFolds
Parameters:
int[], int[]
Returns:
int
Method signature:
int numFolds(int[] paper, int[] box)
(be sure your method is public)

Notes

  • After the paper is folded, it is possible that it has fractional dimensions.
  • The paper will fit into the box even if one or both of the dimensions are exactly the same as the corresponding box dimensions.

Constraints

  • paper will contain exactly two elements.
  • box will contain exactly two elements.
  • Each element of paper and box will be between 1 and 10000, inclusive.

Examples

  1. {8, 11}

    {6, 10}

    Returns: 1

    By folding the paper so that the length is reduced from 11 to 5.5 inches, it will fit inside the box if you rotate it 90 degrees.

  2. {11, 17}

    {6, 4}

    Returns: 4

    There are two ways to fold the paper so that it fits within the box. First, you could fold the width in half to get 5.5 inches, and then fold the length in half three times to get 2.125 inches. Second, you could fold the width in half twice to get 2.25 inches, and then fold the length in half twice to get 4.25 inches. In this case, you must also rotate 90 degrees to fit the paper in.

  3. {11, 17}

    {5, 4}

    Returns: 4

    Now, you must use the second method to get it to fit: Fold the width and length each twice, and rotate 90 degrees. If you try fitting without rotating, it would take 5 folds.

  4. {1000,1000}

    {62,63}

    Returns: -1

    Folding in each direction 4 times, you can get the paper down to 62.5 x 62.5. However, this will not fit into the box because neither dimension fits in 62.

  5. {512,2}

    {2,2}

    Returns: 8

  6. {100,30}

    {60,110}

    Returns: 0

  7. {1895, 6416}

    {401, 1000}

    Returns: 5

  8. {3169, 3464}

    {1785, 225}

    Returns: 5

  9. {5645, 3137}

    {2229, 27}

    Returns: -1

  10. {8994, 5100}

    {982, 6753}

    Returns: 4

  11. {7682, 6447}

    {193, 436}

    Returns: -1

  12. {8453, 3489}

    {5592, 6463}

    Returns: 1

  13. {9889, 9272}

    {6568, 67}

    Returns: -1

  14. {3541, 9525}

    {7555, 9968}

    Returns: 0

  15. {5022, 689}

    {4937, 1855}

    Returns: 1

  16. {3664, 3995}

    {87, 937}

    Returns: 8

  17. {9155, 8169}

    {6135, 3463}

    Returns: 3

  18. {7983, 4143}

    {9349, 1122}

    Returns: 2

  19. {1068, 9732}

    {5416, 3972}

    Returns: 1

  20. {2056, 9360}

    {1974, 5026}

    Returns: 2

  21. {8426, 9294}

    {6857, 2810}

    Returns: 3

  22. {6403, 5814}

    {3858, 37}

    Returns: -1

  23. {5755, 2026}

    {4055, 3020}

    Returns: 1

  24. {9561, 5779}

    {1501, 3556}

    Returns: 4

  25. {5108, 2924}

    {5809, 9686}

    Returns: 0

  26. {3377, 7517}

    {389, 3153}

    Returns: 6

  27. {2818, 4928}

    {6509, 4757}

    Returns: 0

  28. {6343, 5242}

    {5573, 3647}

    Returns: 1

  29. {7292, 9059}

    {9255, 7465}

    Returns: 0

  30. {1574, 882}

    {5123, 6123}

    Returns: 0

  31. {2349, 2412}

    {7150, 8022}

    Returns: 0

  32. {7745, 9698}

    {4288, 682}

    Returns: 5

  33. {4232, 7405}

    {4519, 8760}

    Returns: 0

  34. {5421, 2805}

    {3, 4863}

    Returns: -1

  35. {6533, 7604}

    {1309, 48}

    Returns: -1

  36. {1482, 8640}

    {2388, 6647}

    Returns: 1

  37. {1350, 2462}

    {1440, 9103}

    Returns: 0

  38. {8304, 7859}

    {2148, 6980}

    Returns: 3

  39. {9556, 9370}

    {770, 514}

    Returns: -1

  40. {8830, 8903}

    {7963, 48}

    Returns: -1

  41. {3724, 8080}

    {46, 2032}

    Returns: -1

  42. {5918, 7087}

    {2300, 85}

    Returns: -1

  43. {5006, 3607}

    {1800, 8290}

    Returns: 2

  44. {5061, 1100}

    {4675, 7479}

    Returns: 0

  45. {5540, 5216}

    {1285, 3906}

    Returns: 4

  46. {978, 1187}

    {490, 6135}

    Returns: 1

  47. {1998, 5645}

    {515, 15}

    Returns: -1

  48. {7303, 8691}

    {814, 276}

    Returns: -1

  49. {2528, 3911}

    {4079, 639}

    Returns: 2

  50. {1242, 5184}

    {2384, 4872}

    Returns: 1

  51. {6196, 9201}

    {75, 1154}

    Returns: -1

  52. {1871, 2385}

    {9656, 1088}

    Returns: 1

  53. { 1895, 6416 }

    { 401, 1000 }

    Returns: 5

  54. { 16, 16 }

    { 1, 1 }

    Returns: 8

  55. { 256, 1 }

    { 1, 1 }

    Returns: 8

  56. { 8, 11 }

    { 3, 2 }

    Returns: 4

  57. { 11, 17 }

    { 6, 4 }

    Returns: 4

  58. { 2, 1 }

    { 1, 1 }

    Returns: 1

  59. { 1, 256 }

    { 1, 1 }

    Returns: 8

  60. { 10000, 2 }

    { 10000, 4 }

    Returns: 0

  61. { 11, 11 }

    { 5, 11 }

    Returns: 2

  62. { 1, 257 }

    { 1, 1 }

    Returns: -1

  63. { 7000, 7000 }

    { 2000, 2000 }

    Returns: 4

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2024, TopCoder, Inc. All rights reserved.
This problem was used for: