TopCoder Statistics - Problem Statement

Problem Statement

A popular musical group 'Flattened' has decided to release a new album. It consists of nSongs songs. All songs are of the same length (given in seconds). A CD can store cdCapacity seconds of audio. Each pair of consecutive songs must be separated by a 1 second pause. The group director is superstitious, so the number of songs on a CD must never be divisible by 13. Given these constraints, return the smallest number of CDs required to fit the entire album.

Definition

Class:: NewAlbum
Method:: leastAmountOfCDs
Parameters:: int, int, int
Returns:: int
Method signature:: int leastAmountOfCDs(int nSongs, int length, int cdCapacity)
(be sure your method is public)

Constraints

nSongs will be between 1 and 100, inclusive.
cdCapacity will be between 1 and 10000, inclusive.
length will be between 1 and cdCapacity, inclusive.

Examples

7

2

6

Returns: 4

There are at most two songs on each CD.
20

1

100

Returns: 1

All the songs will fit on a single CD.
26

1

100

Returns: 2

Even though all 26 songs will fit on a single CD, we must use two CDs because 26 is divisible by 13.
26

3

51

Returns: 3
67

271

1000

Returns: 23
27

1

27

Returns: 3
63

1

99

Returns: 2
38

27

705

Returns: 2
61

12

319

Returns: 3
31

25

483

Returns: 2
75

5

373

Returns: 2
85

19

923

Returns: 2
90

19

642

Returns: 3
67

37

712

Returns: 4
63

30

821

Returns: 3
58

4

163

Returns: 2
48

20

740

Returns: 2
69

6

304

Returns: 2
74

9

616

Returns: 2
58

11

390

Returns: 2
97

20

602

Returns: 4
61

42

701

Returns: 4
54

13

586

Returns: 2
54

9

279

Returns: 2
77

50

838

Returns: 5
47

5

102

Returns: 3
28

59

919

Returns: 2
79

7

175

Returns: 4
29

50

858

Returns: 2
100

10000

10000

Returns: 100
100

1

10000

Returns: 1
79

89

264

Returns: 40
100

89

582

Returns: 17
100

657

10000

Returns: 7
100

687

9572

Returns: 9
100

10

150

Returns: 9
1

1

1

Returns: 1
1

1

10000

Returns: 1
1

10000

10000

Returns: 1
1

13

13

Returns: 1
1

12

13

Returns: 1
100

1

27

Returns: 8
88

1

49

Returns: 4
27

1

27

Returns: 3
67

271

1000

Returns: 23
43

2

45

Returns: 3
28

1

29

Returns: 2
40

1

53

Returns: 2
33

1

40

Returns: 2
67

1

53

Returns: 3
27

1

28

Returns: 3
58

1

29

Returns: 4
42

1

27

Returns: 3
88

11

179

Returns: 6
26

1

100

Returns: 2
43

2

44

Returns: 3
33

5

120

Returns: 2
2

2

2

Returns: 2
47

1

33

Returns: 3
76

1

100

Returns: 2
80

1

81

Returns: 2
28

1

30

Returns: 2
50

9

99

Returns: 5
13

1

28

Returns: 2
73

1

60

Returns: 3
43

1

29

Returns: 3
13

1

1000

Returns: 2
1

1

1

Returns: 1
27

1

53

Returns: 1
94

1

53

Returns: 4
53

1

39

Returns: 3
2

2

5

Returns: 1
30

1

33

Returns: 2
80

2

80

Returns: 4
100

3

11

Returns: 34
88

1

29

Returns: 6
13

1

2000

Returns: 2
28

4

75

Returns: 2
100

2

2

Returns: 100
97

9997

9997

Returns: 97
10

1

19

Returns: 1
53

1

79

Returns: 2
2

5

11

Returns: 1
54

1

55

Returns: 2
53

1

40

Returns: 3
55

1

27

Returns: 5
13

13

13

Returns: 13
2

10

21

Returns: 1
100

1

5

Returns: 34
3

5

17

Returns: 1
67

2

80

Returns: 3
2

1

3

Returns: 1
12

1

23

Returns: 1
80

1

54

Returns: 4
65

1288

1687

Returns: 65
58

562

8666

Returns: 4
1

5

5

Returns: 1
88

1

51

Returns: 4
29

4

80

Returns: 2
1

10

10

Returns: 1
4

1

3

Returns: 2
53

1

53

Returns: 3
1

13

13

Returns: 1
80

1

52

Returns: 4
28

20

319

Returns: 2
1

12

12

Returns: 1
3

1

5

Returns: 1
13

1

100

Returns: 2
80

10

43

Returns: 20
61

2

48

Returns: 4
88

1

30

Returns: 6
13

88

6150

Returns: 2
33

1

39

Returns: 2
41

1

28

Returns: 4
13

1

5

Returns: 5
40

1

54

Returns: 2
5

1

10

Returns: 1

Statistics

Problem Statement for "NewAlbum"

Problem Statement

Definition

Constraints

Examples