CF788C.The Great Mixing

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Sasha and Kolya decided to get drunk with Coke, again. This time they have kk types of Coke. ii -th type is characterised by its carbon dioxide concentration . Today, on the party in honour of Sergiy of Vancouver they decided to prepare a glass of Coke with carbon dioxide concentration . The drink should also be tasty, so the glass can contain only integer number of liters of each Coke type (some types can be not presented in the glass). Also, they want to minimize the total volume of Coke in the glass.

Carbon dioxide concentration is defined as the volume of carbone dioxide in the Coke divided by the total volume of Coke. When you mix two Cokes, the volume of carbon dioxide sums up, and the total volume of Coke sums up as well.

Help them, find the minimal natural number of liters needed to create a glass with carbon dioxide concentration . Assume that the friends have unlimited amount of each Coke type.

输入格式

The first line contains two integers nn , kk ( 0<=n<=10000<=n<=1000 , 1<=k<=1061<=k<=10^{6} ) — carbon dioxide concentration the friends want and the number of Coke types.

The second line contains kk integers a1,a2,...,aka_{1},a_{2},...,a_{k} ( 0<=ai<=10000<=a_{i}<=1000 ) — carbon dioxide concentration of each type of Coke. Some Coke types can have same concentration.

输出格式

Print the minimal natural number of liter needed to prepare a glass with carbon dioxide concentration , or -1 if it is impossible.

输入输出样例

  • 输入#1

    400 4
    100 300 450 500
    

    输出#1

    2
    
  • 输入#2

    50 2
    100 25
    

    输出#2

    3
    

说明/提示

In the first sample case, we can achieve concentration using one liter of Coke of types and : .

In the second case, we can achieve concentration using two liters of type and one liter of type: .

首页