Currency System in Geraldion (Codeforces 560A)

最新推荐文章于 2016-07-23 19:20:14 发布

weixin_34246551

最新推荐文章于 2016-07-23 19:20:14 发布

阅读量74

点赞数

原文链接：http://www.cnblogs.com/ttmj865/p/4675994.html

版权

A Currency System in Geraldion

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Description

A magic island Geraldion, where Gerald lives, has its own currency system. It uses banknotes of several values. But the problem is, the system is not perfect and sometimes it happens that Geraldionians cannot express a certain sum of money with any set of banknotes. Of course, they can use any number of banknotes of each value. Such sum is called unfortunate. Gerald wondered: what is the minimumunfortunate sum?

Input

The first line contains number n (1 ≤ n ≤ 1000) — the number of values of the banknotes that used in Geraldion.

The second line contains n distinct space-separated numbers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁶) — the values of the banknotes.

Output

Print a single line — the minimum unfortunate sum. If there are no unfortunate sums, print - 1.

Sample Input

Input

5 1 2 3 4 5

Output

-1
题目大意：
求N个数不能组成最小的数。

分析：
这道题看起来很麻烦，其实很简单。只要看是否有1，因为前面给了范围1 ≤ a_i ≤ 10⁶,所以能给出的最小数就是1.因此N个数中有1，输出1；否则输出-1.

代码：

 1 #include<cstdio>
 2 #include<iostream>
 3 #include<cstring>
 4 #include<algorithm>
 5 using namespace std;
 6 
 7 int n[1000];
 8 
 9 int main ()
10 {
11     int n, m;
12     while(scanf("%d",&n)!=EOF)
13     {
14         int  f=0;
15         for(int i=0; i<=n; i++)
16         {
17             
18             scanf("%d",&m);
19             if (m==1)    f=1;
20         }
21         if(f)
22             printf("-1\n");
23         else
24             printf("1\n"); 
25     }
26     return 0;
27 }