正整數

題目鏈接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=84077#problem/A

題目：

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輸出-1，沒有1輸出1.

 1 #include<iostream>
 2 using namespace std;
 3 int a[1000];
 4 int main()
 5 {
 6 int t,i;
 7 cin>>t
 8 for(i=0;i<t;i++)
 9 cin>>a[i];
10 for(i=0;i<t;i++)
11  if(a[i]==1)
12  {cout<<-1<<endl;
13  break;}
14    if(i==t)
15        cout<<1<<endl;
16 return 0;
17 }

轉載于:https://www.cnblogs.com/fenhong/p/4678584.html

本文來自互聯網用戶投稿，該文觀點僅代表作者本人，不代表本站立場。本站僅提供信息存儲空間服務，不擁有所有權，不承擔相關法律責任。
如若轉載，請注明出處：http://www.pswp.cn/news/375706.shtml
繁體地址，請注明出處：http://hk.pswp.cn/news/375706.shtml
英文地址，請注明出處：http://en.pswp.cn/news/375706.shtml

如若內容造成侵權/違法違規/事實不符，請聯系多彩編程網進行投訴反饋email:809451989@qq.com，一經查實，立即刪除！