hdu 1587
来源:互联网 发布:linux管道 文件 编辑:程序博客网 时间:2024/05/27 12:21
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?
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.
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.
Sample Input
2 5
2 3
Sample Output
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?
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.
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.
Sample Input
2 5
2 3
Sample Output
2
代码:
#include<stdio.h>int main(){int a,n,m,b,i;while((scanf("%d%d",&n,&m))!=EOF){b=100000000;for(i=0;i<n;i++){scanf("%d",&a);if(a<b) b=a;}printf("%d\n",m/b);}return 0;}
0 0
- hdu 1587
- hdu 1587
- HDU 1587 Flowers
- hdu 1587 Flowers
- hdu-oj 1587 Flowers
- HDU 1587 Flowers
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- API
- Android Handler的使用一
- Spring-创建bean
- Subversion Edge安装
- 鸟哥的Linux私房菜(基础篇)- 第二十章、启动流程、模块管理与 Loader
- hdu 1587
- Java的悲观锁与乐观锁
- IOS AssetsLibrary框架的使用
- hdoj3979Monster【贪心】
- vs_start vs_end详解
- class_getInstanceMethod和class_getClassMethod
- 为什么选择 Java 8 ?
- utf8字符串截取
- lightoj 1078 - Integer Divisibility 【同余】