{　二分答案　}soj2015

最新推荐文章于 2025-07-18 18:12:56 发布

原创最新推荐文章于 2025-07-18 18:12:56 发布 · 677 阅读

CC 4.0 BY-SA版权

本文介绍了一个关于制作完美项链的问题。主人公计划为朋友们准备由不同种类珍珠组成的M-perfect项链作为新年礼物，并希望了解在有限珍珠数量下能制作的最大项链数。题目要求通过输入不同种类珍珠的数量及每条项链所需的珍珠数M，计算并输出最多可以制作的完美项链数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

2015. A New Year Gift

Description

Windbreaker was planning to send his friends some necklaces as New Year gifts. To show sincerity ，he decided to make the necklaces all by himself. He bought some kinds of pearls and each kind of pearls has a different color from others. He wanted to make each necklace consisted of M pearls from different kinds, that’s what he called M-perfect necklace. Windbreaker wanted to know the maximum number of necklaces he could send out to his friends. The number of pearls of each kind and M are given, and now you are asked to tell Windbreaker how many M-perfect necklaces he could make at most

Input

You will be given a number of cases in the input. Each case starts with a positive integer n(n<=1000),which is the number of different kinds;

The second line contains n positive numbers represent for the number of pearls of each kind which will not exceed 2000.

The third line contains a positive number M(1<=M<=100).

The end of input is indicated by a line containing n=0.

Output

For each test case, output a line containing the Maximum number of M-perfect necklaces.

Sample Input

Copy sample input to clipboard