Problem Statement
Definition
- Class:
- SchoolAssembly
- Method:
- getBeans
- Parameters:
- int, int
- Returns:
- int
- Method signature:
- int getBeans(int kids, int quantity)
- (be sure your method is public)
Constraints
- kids will be between 1 and 1000, inclusive.
- quantity will be between 2 and 25, inclusive.
Examples
1
5
Returns: 2
Only one kid to buy for. Since the first bag you buy could contain 4 of each color, you must buy a second bag to ensure the child has 5 of the same color.
1
2
Returns: 1
5
5
Returns: 3
If we buy 2 bags, we will be able to give 4 of the children 5 beans. However, we could be left with 4 beans of each color, requiring the third bag.
223
15
Returns: 171
1000
25
Returns: 1255
710
25
Returns: 893
88
22
Returns: 101
209
18
Returns: 192
419
14
Returns: 296
165
20
Returns: 169
406
2
Returns: 41
399
19
Returns: 383
919
16
Returns: 739
512
17
Returns: 439
59
18
Returns: 57
206
12
Returns: 126
757
18
Returns: 685
987
8
Returns: 397
833
16
Returns: 670
488
13
Returns: 320
484
5
Returns: 122
278
7
Returns: 99
526
11
Returns: 292
244
6
Returns: 75
576
7
Returns: 203
103
20
Returns: 107
656
23
Returns: 759
184
16
Returns: 151
39
24
Returns: 52
556
3
Returns: 84
663
14
Returns: 467
354
6
Returns: 108
93
14
Returns: 68
900
15
Returns: 678
596
25
Returns: 750
393
23
Returns: 457
936
9
Returns: 423
465
24
Returns: 563
172
20
Returns: 176
442
21
Returns: 469
476
9
Returns: 216
189
6
Returns: 58
690
17
Returns: 590
798
6
Returns: 241
631
23
Returns: 731
371
13
Returns: 244
410
22
Returns: 456
523
15
Returns: 396
404
11
Returns: 225
116
16
Returns: 96
47
24
Returns: 61
239
3
Returns: 37
459
21
Returns: 486
156
19
Returns: 152
593
15
Returns: 448
5
10
Returns: 5
1
8
Returns: 2
1000
25
Returns: 1255
999
25
Returns: 1254
13
25
Returns: 22
1
25
Returns: 7
25
25
Returns: 37
2
4
Returns: 1
1
21
Returns: 6
2
7
Returns: 2
23
23
Returns: 31
1
20
Returns: 5
3
3
Returns: 1
1
18
Returns: 5
8
2
Returns: 1
4
3
Returns: 1
571
24
Returns: 690
20
25
Returns: 30
6
6
Returns: 3