zoukankan      html  css  js  c++  java
  • Codeforces Round #313 A. Currency System in Geraldion(简单题)

    A. Currency System in Geraldion
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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
    ");
            }
            else
            {
                printf("1
    ");
            }
        }
        return 0;
    }


  • 相关阅读:
    HTML入门之003
    html入门之002
    HTML入门之001
    端口
    计算机基础
    二进制的学习
    markdown基础
    css基础
    html基础之三
    html基础之二
  • 原文地址:https://www.cnblogs.com/jzssuanfa/p/6857151.html
Copyright © 2011-2022 走看看