hdu-oj 1587 Flowers

Flowers

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2731    Accepted Submission(s): 1831

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 52 3

 Sample Output

2题目大意：
题目就是要求买的花最多，m/最少花的价格
附代码：
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int main(){  int n,m,i,k;   int a[100];    while(scanf("%d%d",&n,&m)!=EOF){      for(i=0;i<n;i++)          scanf("%d",&a[i]);      sort(a,a+n);      k=m/a[0];      printf("%d\n",k);   }    return 0;}