hdu 1587 Flowers

 

Flowers

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

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

 

 

 

#include<iostream>
#include<algorithm>
using namespace std;
int p[1000];

int main()
{
 int n,m,i,num;
 while(cin>>n>>m)
 {
  for(i=0;i<n;i++)
   cin>>p[i];

  sort(p,p+n);
  num=m/p[0];
  cout<<num<<endl;
 }
 return 0;
}