zoukankan      html  css  js  c++  java
  • Currency System in Geraldion

    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 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 test(s)
    Input
    5
    1 2 3 4 5
    Output
    -1
    题意:给你某些数,经过任意加,是否可以组成任意数,是输出-1, 不是输出最小的不能组成的数,如果有1,经过任意加减肯定可以组成任意我们想要的数,如果没有1,那构不成的最小的数肯定是1啦
     1 #include<iostream>
     2 #include<cstdio>
     3 
     4 using namespace std;
     5 
     6 int main()
     7 {
     8     int n, m, flag;
     9 
    10     while(scanf("%d", &n) != EOF)
    11     {
    12         flag = 0;
    13 
    14         while(n--)
    15         {
    16             scanf("%d", &m);
    17 
    18             if(m == 1)
    19                 flag = 1;
    20         }
    21         if(flag)
    22             puts("-1");
    23         else
    24             puts("1");
    25     }
    26     return 0;
    27 }
    让未来到来 让过去过去
  • 相关阅读:
    C++ 对象间通信框架 V2.0 ××××××× 之(三)
    C++ 对象间通信框架 V2.0 ××××××× 之(二)
    C++ 对象间通信框架 V2.0 ××××××× 之一
    C++ 对象间通讯机制 框架实现
    websocket 传输数据帧打包 (client端)
    SetwindowText 之线程阻塞
    oracle虚拟索引的创建
    函数索引
    关于is null和is not null不能利用索引的测试
    索引的选择性
  • 原文地址:https://www.cnblogs.com/Tinamei/p/4707983.html
Copyright © 2011-2022 走看看