货币体系

最新推荐文章于 2025-06-26 20:37:57 发布

weixin_30788619

最新推荐文章于 2025-06-26 20:37:57 发布

阅读量55

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/huangguodong/p/4678455.html

本文探讨了一道算法题目，即求解一组数值中无法通过任何组合方式得到的最小整数。若数值集合中包含1，则所有整数均可被表示；反之，无法表示的最小整数为1。

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

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.

思路：如果n个数中有1，则都能组成，输出-1，否则不能组成的最小整数1，输出1.

英文不好一直看不懂题意也是日了狗了.....

代码如下：

 1 #include <iostream>
 2 using namespace std;
 3 int a[1005];
 4 int main()
 5 {
 6     int n;
 7     while(cin>>n)
 8     {
 9         int flag=0;
10         for(int i=0;i<n;i++)
11         {
12             cin>>a[i];
13             if(a[i]==1)
14                 flag=1;
15         }
16        
17         if(flag)
18             cout<<-1<<endl;
19         else
20             cout<<1<<endl;
21     }
22     return 0;
23 }