IdenticalBags | Topcoder Archive

Problem Statement

You are preparing for Halloween. You like to hand out bags of candy. In order to prevent arguments between the kids who get them, you want all bags to be identical.

You have a supply of various candy. Each element of candy is the number of pieces of a specific candy type. You want to create bags that will contain bagSize pieces of candy each. Compute and return the maximum number of identical bags you can make.

Definition

Class:: IdenticalBags
Method:: makeBags
Parameters:: long[], long
Returns:: long
Method signature:: long makeBags(long[] candy, long bagSize)
(be sure your method is public)

Constraints

candy will contain between 1 and 100 elements, inclusive.
Each element of candy will be between 1 and 10^18, inclusive.
bagSize will be between 1 and 10^18, inclusive.

Examples

```
{10, 11, 12}
```
```
3
```
```
Returns: 10
```
You can make 10 identical bags, each containing one candy of each type.
```
{10, 11, 12, 1, 2, 3}
```
```
3
```
```
Returns: 10
```
We have a few more candy types than in Example #0, but the optimal solution remained the same.
```
{100}
```
```
7
```
```
Returns: 14
```
This time you can make (100 div 7) bags, each containing 7 candies of the only type you have.

{10000000000, 20000000000, 30000000000}

Returns: 10000000000

Watch out for integer overflow.

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.