打CF,学算法——一星级Codeforces Round #313 (Div. 2) A. Currency System in Geraldion
Posted liguangsunls
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了打CF,学算法——一星级Codeforces Round #313 (Div. 2) A. Currency System in Geraldion相关的知识,希望对你有一定的参考价值。
提交链接:http://codeforces.com/contest/560/problem/A
题面:
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 calledunfortunate. Gerald wondered: what is the minimumunfortunate sum?
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 numbersa1,?a2,?...,?an (1?≤?ai?≤?106) — the values of the banknotes.
Print a single line — the minimum unfortunate sum. If there are no unfortunate sums, print?-?1.
5 1 2 3 4 5
-1
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
解题:看有无1,没有1是绝对得不到1的。能够直接扫一遍,做一个标记,看1是否出现过。Hack了一个。他遇到1就停止输入,然而我却Hack失败了,由于系统仅仅判out文件....
以上是关于打CF,学算法——一星级Codeforces Round #313 (Div. 2) A. Currency System in Geraldion的主要内容,如果未能解决你的问题,请参考以下文章
打CF,学算法——二星级CF 520B Two Buttons