CF_560A_CurrencySystemInGeraldion
来源:互联网 发布:单片机的32个引脚介绍 编辑:程序博客网 时间:2024/06/06 16:43
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.
51 2 3 4 5
-1
水题
但是还是木了下
两分钟的题十分钟才出代码
有1果断多少钱都凑得出
没1果断凑不出1
所以……
#include <iostream>#include <stdio.h>#include <algorithm>using namespace std;const int M=1005;int va[M];int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&va[i]); sort(va,va+n); if(va[0]==1) { printf("-1\n"); return 0; } else printf("1\n"); return 0;}
排序也是误入歧途懒得改了
直接在输入的时候检查1就可以了……
- CF_560A_CurrencySystemInGeraldion
- VC++的Unicode编程
- bash多进程与wait,sleep区别
- 傥膛诺澄凡嘶诎嘎
- 引用字体
- [2015-08-08] python019
- CF_560A_CurrencySystemInGeraldion
- 接口
- 算法竞赛入门经典(第二版) 习题3-6 Crossword Answers UVa232 Finals1994
- C++类的构造函数和析构函数的调用顺序
- 互联网金融行业全景及展望
- UVA 538 - Balancing Bank Accounts
- 天道酬勤
- 对萍蹈堵钾嚼释锹
- OpenCV学习笔记(1)—— 摄像机模型与标定2