Statistics

Problem Statement for "HouseNumbering"

Problem Statement

You have gotten a new job: your task is to put house numbers onto a range of houses. All these houses are on one side of a long road. The first of these houses (the one with the smallest number) has the number firstHouse. There are numberOfHouses houses in the range of houses you should number.

As is customary, the street uses odd house numbers for one side of the street and even house numbers for the other side. As the houses you should number are on the same side, their numbers all have the same parity.

Before you go to the street, you need to purchase the material you need. The hardware store only sells individual digits. Calculate how many copies of each digit you'll need. Return a int[] with exactly 10 elements, element x being the number of times the digit x occurs in your collection of house numbers.

Definition

Class:
HouseNumbering
Method:
prepareDigits
Parameters:
int, int
Returns:
int[]
Method signature:
int[] prepareDigits(int firstHouse, int numberOfHouses)
(be sure your method is public)

Constraints

  • firstHouse will be between 1 and 1000, inclusive.
  • numberOfHouses will be between 1 and 1000, inclusive.

Examples

  1. 7

    4

    Returns: {0, 3, 0, 1, 0, 0, 0, 1, 0, 1 }

    The four houses have numbers 7, 9, 11 and 13. You need three digits 1 and one each of digits 3, 7, and 9.

  2. 2

    6

    Returns: {1, 2, 2, 0, 1, 0, 1, 0, 1, 0 }

    These houses have numbers 2, 4, 6, 8, 10, and 12. Make sure you don't forget the digit 0 you need for the number 10.

  3. 997

    1

    Returns: {0, 0, 0, 0, 0, 0, 0, 1, 0, 2 }

  4. 160

    47

    Returns: {15, 25, 42, 5, 14, 2, 14, 5, 14, 5 }

  5. 1000

    1000

    Returns: {400, 700, 900, 200, 400, 200, 400, 200, 400, 200 }

  6. 999

    1000

    Returns: {200, 900, 699, 400, 200, 400, 200, 400, 200, 400 }

  7. 361

    65

    Returns: {5, 18, 5, 38, 50, 18, 10, 23, 10, 18 }

  8. 441

    567

    Returns: {105, 506, 105, 219, 140, 260, 110, 220, 105, 218 }

  9. 465

    585

    Returns: {110, 544, 110, 224, 123, 272, 125, 227, 110, 227 }

  10. 352

    264

    Returns: {77, 25, 78, 49, 128, 79, 133, 80, 118, 25 }

  11. 525

    396

    Returns: {90, 325, 88, 127, 40, 158, 90, 169, 90, 169 }

  12. 402

    631

    Returns: {240, 447, 242, 115, 290, 165, 270, 110, 236, 110 }

  13. 42

    815

    Returns: {293, 516, 343, 180, 347, 185, 334, 131, 293, 130 }

  14. 429

    675

    Returns: {115, 639, 116, 255, 156, 305, 170, 293, 115, 250 }

  15. 25

    981

    Returns: {145, 884, 198, 396, 200, 397, 200, 396, 198, 384 }

  16. 105

    1

    Returns: {1, 1, 0, 0, 0, 1, 0, 0, 0, 0 }

  17. 271

    966

    Returns: {196, 889, 262, 388, 195, 388, 195, 393, 200, 393 }

  18. 989

    812

    Returns: {185, 844, 486, 342, 180, 342, 136, 292, 131, 304 }

  19. 494

    742

    Returns: {273, 614, 273, 125, 277, 175, 324, 174, 318, 162 }

  20. 560

    10

    Returns: {2, 0, 2, 0, 2, 10, 7, 5, 2, 0 }

  21. 940

    836

    Returns: {353, 681, 653, 180, 352, 185, 308, 135, 302, 165 }

  22. 921

    324

    Returns: {80, 429, 85, 150, 85, 134, 34, 95, 30, 134 }

  23. 582

    438

    Returns: {182, 324, 183, 95, 162, 53, 178, 90, 181, 95 }

  24. 236

    244

    Returns: {74, 25, 103, 72, 123, 75, 124, 37, 74, 25 }

  25. 536

    527

    Returns: {205, 395, 205, 102, 210, 132, 211, 105, 211, 100 }

  26. 368

    453

    Returns: {186, 232, 173, 61, 185, 95, 186, 97, 186, 95 }

  27. 981

    248

    Returns: {75, 363, 75, 125, 63, 75, 25, 72, 25, 84 }

  28. 35

    575

    Returns: {105, 354, 105, 223, 110, 225, 110, 225, 107, 220 }

  29. 384

    734

    Returns: {272, 551, 271, 133, 322, 171, 317, 170, 296, 125 }

  30. 705

    362

    Returns: {88, 376, 89, 157, 49, 108, 35, 156, 85, 157 }

  31. 616

    351

    Returns: {155, 245, 155, 44, 105, 35, 148, 85, 155, 85 }

  32. 572

    589

    Returns: {227, 485, 228, 110, 228, 119, 273, 134, 228, 110 }

  33. 781

    201

    Returns: {70, 193, 20, 60, 20, 60, 20, 70, 71, 110 }

  34. 245

    808

    Returns: {130, 721, 158, 341, 183, 347, 180, 342, 160, 292 }

  35. 861

    747

    Returns: {175, 825, 352, 302, 125, 271, 125, 274, 145, 324 }

  36. 937

    958

    Returns: {195, 887, 621, 388, 200, 387, 195, 387, 171, 369 }

  37. 37

    129

    Returns: {10, 86, 57, 38, 15, 40, 15, 41, 15, 38 }

  38. 342

    101

    Returns: {30, 10, 31, 39, 81, 32, 30, 10, 30, 10 }

  39. 372

    593

    Returns: {228, 389, 229, 124, 279, 138, 224, 109, 228, 110 }

  40. 393

    521

    Returns: {105, 426, 105, 211, 117, 204, 100, 204, 100, 208 }

  41. 554

    833

    Returns: {351, 685, 416, 130, 297, 156, 352, 185, 352, 185 }

  42. 259

    100

    Returns: {10, 30, 31, 80, 39, 30, 10, 30, 10, 30 }

  43. 665

    893

    Returns: {190, 868, 415, 368, 165, 314, 156, 369, 190, 369 }

  44. 903

    233

    Returns: {74, 305, 75, 106, 25, 72, 24, 67, 20, 115 }

  45. 950

    716

    Returns: {314, 670, 504, 161, 263, 125, 268, 125, 264, 145 }

  46. 866

    343

    Returns: {154, 361, 153, 85, 153, 57, 101, 35, 121, 85 }

  47. 224

    483

    Returns: {191, 185, 182, 100, 197, 100, 197, 100, 197, 95 }

  48. 763

    113

    Returns: {10, 32, 10, 33, 10, 33, 14, 57, 64, 76 }

  49. 792

    427

    Returns: {180, 418, 181, 95, 179, 90, 148, 44, 175, 94 }

  50. 620

    362

    Returns: {158, 257, 163, 62, 109, 35, 147, 85, 157, 85 }

  51. 692

    894

    Returns: {368, 690, 609, 190, 359, 140, 323, 190, 364, 189 }

  52. 294

    901

    Returns: {368, 640, 371, 190, 371, 190, 370, 190, 370, 191 }

  53. 792

    830

    Returns: {351, 685, 577, 185, 327, 131, 296, 134, 346, 184 }

  54. 245

    829

    Returns: {131, 747, 158, 345, 183, 351, 185, 351, 185, 302 }

  55. 4

    2

    Returns: {0, 0, 0, 0, 1, 0, 1, 0, 0, 0 }

  56. 2

    3

    Returns: {0, 0, 1, 0, 1, 0, 1, 0, 0, 0 }

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: