(HDU)1587 -- Flowers (花)

题目链接:https://vjudge.net/problem/HDU-1587

其实就是找最小数的题..

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <cmath>
 4 #include <iostream>
 5 #include <algorithm>
 6 #include <string>
 7 #include <cstdlib>
 8 
 9 using namespace std;
10 
11 int main()
12 {
13     int n,m,i,temp;
14     while(~scanf("%d %d",&n,&m))
15     {
16         int ans=10000;
17         for(i=1;i<=n;i++)
18         {
19             scanf("%d",&temp);
20             if(temp<ans) ans=temp;
21         }
22         printf("%d
",m/ans);
23     }
24 }
原文地址:https://www.cnblogs.com/ACDoge/p/6141775.html