output_description: Print the maximum number of doughnuts that can be made under the condition.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N X
      m_1
      m_2
      :
      m_N
attempt: #include <bits/stdc++.h>  
  
  using namespace std;
  
  #define int long long
  #define FOR(i, j, k) for(int i = j; i < k; ++i)
  #define rep(i, j) FOR(i, 0, j)
  #define INF 1e9
  #define LINF 1e18
  
  typedef unsigned long long ull;
  typedef pair<int, int> P;
  typedef pair<P, int> Pi;
  typedef pair<P, P> PP;
  
  const int MOD = 1e9 + 7;
  const int dy[]={0, 0, 1, -1};
  const int dx[]={1, -1, 0, 0};
  
  template <class T> void chmin(T& a, const T& b) { a = min(a, b); }
  template <class T> void chmax(T& a, const T& b) { a = max(a, b); }
  
  int m[101];
  
  signed main() {
      cin.tie(0);
      ios::sync_with_stdio(false);
  
      int n, x;
      cin >> n >> x;
      int mini = INF;
      rep(i, n) {
          cin >> m[i];
          x -= m[i];
          chmin(mini, m[i]);
      }
      cout << n + x / mini << endl;
      return 0;
  }
problem_description: Statement
  
  Akaki, a patissier, can make N kinds of doughnut using only a certain powder
  called "Okashi no Moto" (literally "material of pastry", simply called Moto
  below) as ingredient. These doughnuts are called Doughnut 1, Doughnut 2, ...,
  Doughnut N. In order to make one Doughnut i (1 ≤ i ≤ N), she needs to consume
  m_i grams of Moto. She cannot make a non-integer number of doughnuts, such as
  0.5 doughnuts.
  
  Now, she has X grams of Moto. She decides to make as many doughnuts as
  possible for a party tonight. However, since the tastes of the guests differ,
  she will obey the following condition:
  
    * For each of the N kinds of doughnuts, make at least one doughnut of that kind.
  
  At most how many doughnuts can be made here? She does not necessarily need to
  consume all of her Moto. Also, under the constraints of this problem, it is
  always possible to obey the condition.
samples: [{"input": "3 1000\n    120\n    100\n    140", "output": "9\n    \n\nShe has 1000 grams of Moto and can make three kinds of doughnuts. If she makes\none doughnut for each of the three kinds, she consumes 120 + 100 + 140 = 360\ngrams of Moto. From the 640 grams of Moto that remains here, she can make\nadditional six Doughnuts 2. This is how she can made a total of nine\ndoughnuts, which is the maximum.\n\n* * *"}, {"input": "4 360\n    90\n    90\n    90\n    90", "output": "4\n    \n\nMaking one doughnut for each of the four kinds consumes all of her Moto.\n\n* * *"}, {"input": "5 3000\n    150\n    130\n    150\n    130\n    110", "output": "26"}]