HDU 1587 Flowers【简单题】
来源:互联网 发布:cdn加速 nginx ip限制 编辑:程序博客网 时间:2024/04/29 17:07
/*
中文题目 花
题目大意:n种花,m块钱,求解最多可以买多少朵花
解题思路:排序,找出最便宜的花,在用总价钱除以最便宜的单价
解题人:lingnichong
解题时间:2014-09-03 22:20:34
解题体会:简单题
*/
Flowers
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2779 Accepted Submission(s): 1856
Problem Description
As you know, Gardon trid hard for his love-letter, and now he's spending too much time on choosing flowers for Angel.
When Gardon entered the flower shop, he was frightened and dazed by thousands kinds of flowers.
"How can I choose!" Gardon shouted out.
Finally, Gardon-- a no-EQ man decided to buy flowers as many as possible.
Can you compute how many flowers Gardon can buy at most?
When Gardon entered the flower shop, he was frightened and dazed by thousands kinds of flowers.
"How can I choose!" Gardon shouted out.
Finally, Gardon-- a no-EQ man decided to buy flowers as many as possible.
Can you compute how many flowers Gardon can buy at most?
Input
Input have serveral test cases. Each case has two lines.
The first line contains two integers: N and M. M means how much money Gardon have.
N integers following, means the prices of differnt flowers.
The first line contains two integers: N and M. M means how much money Gardon have.
N integers following, means the prices of differnt flowers.
Output
For each case, print how many flowers Gardon can buy at most.
You may firmly assume the number of each kind of flower is enough.
You may firmly assume the number of each kind of flower is enough.
Sample Input
2 52 3
Sample Output
2Gardon can buy 5=2+3,at most 2 flower, but he cannot buy 3 flower with 5 yuan.HintHint
#include<stdio.h> #include<algorithm>using namespace std;int a[10000];int main(){ int n,m; int i,j; while(~scanf("%d%d",&n,&m)) { for(i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); printf("%d\n",m/a[0]); } return 0;}
0 0
- HDU 1587 Flowers【简单题】
- HDU 1587 Flowers 简单题
- HDU 1587 Flowers
- hdu 1587 Flowers
- hdu-oj 1587 Flowers
- HDU 1587 Flowers
- HDU 1587 Flowers 解题报告
- HDOJ(HDU) 1587 Flowers(水、、)
- HDU Flowers
- 杭电 HDU ACM 1587 Flowers
- HDU 4325 - Flowers
- HDU-4325-Flowers
- HDU 4325 Flowers
- hdu 4325 Flowers
- HDU 4325 Flowers
- hdu 4325 Flowers
- 【HDU 1087】【水题】Flowers
- HDU Flowers【完全背包】
- 最短路水题= = PKU1125
- C#开源系统大汇总
- android SDK adb命令入门学习
- 使用GCD
- 黑马程序员25——OC之内存管理(autorelease)
- HDU 1587 Flowers【简单题】
- 程序员必备的网站
- Android原生拼音输入法分析
- JAVA的StringBuffer类
- 一个Shell重定向的笔记
- 的风格认识的胳膊v发的过程不V大公分V刹不从v
- 安卓 viewpaper长按事件的实现
- 测试
- template class 随笔