Problem p02814 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
#define range(i, l, r) for (long long int(i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int(i) = (r)-1; (i) >= l; (i)--)
using namespace std;
template <typename T> using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> p) {
  os << "(";
  os << p.first << ", " << p.second;
  return os << ")";
}

template <typename T> ostream &operator<<(ostream &os, vec<T> v) {
  os << "[";
  if (v.size() == 0)
    return os << "]";
  for (int i = 0; i < v.size() - 1; i++) {
    os << v.at(i) << ", ";
  }
  return os << v.at(v.size() - 1) << "]";
}

template <typename T> ostream &operator<<(ostream &os, set<T> &s) {
  os << "{";
  if (s.begin() == s.end())
    return os << "}";
  auto it_first_item = s.begin();
  os << *it_first_item;
  for (auto it = ++it_first_item; it != s.end(); it++) {
    os << ", " << *it;
  }
  return os << "}";
}

template <typename T> ostream &operator<<(ostream &os, unordered_set<T> &s) {
  os << "{";
  if (s.begin() == s.end())
    return os << "}";
  auto it_first_item = s.begin();
  os << *it_first_item;
  for (auto it = ++it_first_item; it != s.end(); it++) {
    os << ", " << *it;
  }
  return os << "}";
}

template <typename K, typename V>
ostream &operator<<(ostream &os, map<K, V> m) {
  os << "{";
  if (m.begin() == m.end())
    return os << "}";
  auto it_first_item = m.begin();
  os << it_first_item->first << ": " << it_first_item->second;
  for (auto it = ++it_first_item; it != m.end(); it++) {
    os << ", " << it->first << ": " << it->second;
  }
  return os << "}";
}

template <typename K, typename V>
ostream &operator<<(ostream &os, unordered_map<K, V> m) {
  os << "{";
  if (m.begin() == m.end())
    return os << "}";
  auto it_first_item = m.begin();
  os << it_first_item->first << ": " << it_first_item->second;
  for (auto it = ++it_first_item; it != m.end(); it++) {
    os << ", " << it->first << ": " << it->second;
  }
  return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
  lint res = 1;
  lint cur_num = num;
  while (e) {
    if (e & 1) {
      res *= cur_num;
      res %= MOD;
    }
    cur_num *= cur_num;
    cur_num %= MOD;
    e >>= 1;
  }
  return res;
}

int main() {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  lint N, M;
  cin >> N >> M;
  vec<lint> a_list(N);
  range(i, 0, N) cin >> a_list.at(i);
  auto num_twos = [](lint a) {
    lint ans = 0;
    while (a % 2 == 0) {
      ans += 1;
      a /= 2;
    }
    return ans;
  };
  lint n_twos = num_twos(a_list.at(0));
  range(i, 1, N) {
    if (num_twos(a_list.at(i)) != n_twos) {
      cout << 0 << "\n";
      return 0;
    }
  }
  lint base = 1LL << n_twos;
  range(i, 0, N) a_list.at(i) /= base;
  lint lcm = a_list.at(0) * a_list.at(1) / __gcd(a_list.at(0), a_list.at(1));
  range(i, 2, N) { lcm = lcm * a_list.at(i) / __gcd(lcm, a_list.at(i)); }
  lcm *= base / 2;
  cout << (M + lcm) / (2 * lcm) << '\n';
}

Fixed submission:
#include <bits/stdc++.h>
#define range(i, l, r) for (long long int(i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int(i) = (r)-1; (i) >= l; (i)--)
using namespace std;
template <typename T> using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> p) {
  os << "(";
  os << p.first << ", " << p.second;
  return os << ")";
}

template <typename T> ostream &operator<<(ostream &os, vec<T> v) {
  os << "[";
  if (v.size() == 0)
    return os << "]";
  for (int i = 0; i < v.size() - 1; i++) {
    os << v.at(i) << ", ";
  }
  return os << v.at(v.size() - 1) << "]";
}

template <typename T> ostream &operator<<(ostream &os, set<T> &s) {
  os << "{";
  if (s.begin() == s.end())
    return os << "}";
  auto it_first_item = s.begin();
  os << *it_first_item;
  for (auto it = ++it_first_item; it != s.end(); it++) {
    os << ", " << *it;
  }
  return os << "}";
}

template <typename T> ostream &operator<<(ostream &os, unordered_set<T> &s) {
  os << "{";
  if (s.begin() == s.end())
    return os << "}";
  auto it_first_item = s.begin();
  os << *it_first_item;
  for (auto it = ++it_first_item; it != s.end(); it++) {
    os << ", " << *it;
  }
  return os << "}";
}

template <typename K, typename V>
ostream &operator<<(ostream &os, map<K, V> m) {
  os << "{";
  if (m.begin() == m.end())
    return os << "}";
  auto it_first_item = m.begin();
  os << it_first_item->first << ": " << it_first_item->second;
  for (auto it = ++it_first_item; it != m.end(); it++) {
    os << ", " << it->first << ": " << it->second;
  }
  return os << "}";
}

template <typename K, typename V>
ostream &operator<<(ostream &os, unordered_map<K, V> m) {
  os << "{";
  if (m.begin() == m.end())
    return os << "}";
  auto it_first_item = m.begin();
  os << it_first_item->first << ": " << it_first_item->second;
  for (auto it = ++it_first_item; it != m.end(); it++) {
    os << ", " << it->first << ": " << it->second;
  }
  return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
  lint res = 1;
  lint cur_num = num;
  while (e) {
    if (e & 1) {
      res *= cur_num;
      res %= MOD;
    }
    cur_num *= cur_num;
    cur_num %= MOD;
    e >>= 1;
  }
  return res;
}

int main() {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  lint N, M;
  cin >> N >> M;
  vec<lint> a_list(N);
  range(i, 0, N) cin >> a_list.at(i);
  auto num_twos = [](lint a) {
    lint ans = 0;
    while (a % 2 == 0) {
      ans += 1;
      a /= 2;
    }
    return ans;
  };
  lint n_twos = num_twos(a_list.at(0));
  range(i, 1, N) {
    if (num_twos(a_list.at(i)) != n_twos) {
      cout << 0 << "\n";
      return 0;
    }
  }
  lint base = 1LL << n_twos;
  range(i, 0, N) a_list.at(i) /= base;
  lint lcm = a_list.at(0);
  range(i, 1, N) { lcm = lcm * a_list.at(i) / __gcd(lcm, a_list.at(i)); }
  lcm *= base / 2;
  cout << (M + lcm) / (2 * lcm) << '\n';
}