Codeforces Round #313 A. Currency System in Geraldion(简单题)

最新推荐文章于 2022-11-22 23:15:14 发布

叶孤心丶

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量1.4k

点赞数

分类专栏： --- CodeForces ----

本文链接：https://blog.csdn.net/yeguxin/article/details/47016209

版权

--- CodeForces ---- 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

在魔法岛屿Geraldion上，有一个不完善的货币系统，使得某些金额无法用现有面额的纸币组合表示。问题来了：最小的这种'不幸'金额是多少？输入包含纸币面额，需要找出不能被表示的最小金额，若不存在则输出-1。

摘要由CSDN通过智能技术生成

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 a1, a2, ..., an (1 ≤ ai ≤ 106) — the values of the banknotes.

Output

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

Sample test(s)

input

5
1 2 3 4 5

          output 
        

-1

题意：问n个数所不能组成的最小的正整数是多少，如果都能组成输出-1

#include<iostream>
#include<stdio.h>

using namespace std;

int main()
{
    int n;
    int m;
    while(scanf("%d",&n)!=EOF)
    {
        int flag = 0;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&m);
            if(m == 1)
            {
                flag = 1;
            }
        }
        if(flag == 1)
        {
            printf("-1\n");
        }
        else
        {
            printf("1\n");
        }
    }
    return 0;
}