zoukankan      html  css  js  c++  java
  • 数据结构——Currency System in Geraldion

    题目:

    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 minimum unfortunate 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 Input

    Input
    5
    1 2 3 4 5
    Output
    -1

    解题思路:

    题目意思就是判断输入的N 个数里面是否有1,若有,则输出-1,没有 则输出1

    程序代码:

    #include <iostream>
    #include <cstdio>
    using namespace std;
    int a[1005];
    int main()
    {
        int n,f=0;
        cin>>n;
        for(int i=0;i<n;i++)
          {
               scanf("%d",&a[i]);
               if(a[i]==1)  f=1;
          }
    
        if(f==1)    cout<<-1<<"
    ";
        else cout<<1<<"
    ";
        return 0;
    
    }
    版权声明:此代码归属博主, 请务侵权!
  • 相关阅读:
    常用纹理数据库
    开源许可协议
    3TB-GPT-MBR
    ubuntu配置cudnn
    神经网络模型种类
    What is R语言
    DataWindow.NET 控件 实现点击列头排序
    PB调用C# Windows窗体
    工商银行卡网上查询开户行
    【DevExpress】1、SearchLookUpEdit详解
  • 原文地址:https://www.cnblogs.com/www-cnxcy-com/p/4675925.html
Copyright © 2011-2022 走看看