#include <bits/stdc++.h>
#pragma warning(disable : 4786)
#pragma warning(disable : 4996)
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1LL;
  for (; e > 0LL; e >>= 1LL) {
    if (e & 1LL) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  long long k;
  cin >> n >> k;
  long long arr[n];
  long long sum = 0;
  long long ans = 0;
  long long pc = 0;
  bool bl = false;
  for (int i = 0; i < n; i++) {
    if (pc != 0) ans++;
    cin >> arr[i];
    sum += arr[i] - pc;
    sum = max(sum, 0LL);
    pc = sum % k;
    ans += (sum / k);
    if (pc != 0 && i == n - 1) {
      ans++;
    }
    sum = 0;
  }
  cout << ans;
}
