Problem p02814 (C++)

Buggy submission (status: Time Limit Exceeded):
// template version 1.15
using namespace std;
#include <bits/stdc++.h>

// varibable settings
#define int long long
const int INF = 1e18;

// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)((b)-1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x)                                                                 \
  sort(all(x));                                                                \
  x.erase(unique(all(x)), x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x) - A.begin())
#define posu(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) {
  if ((a) < (b))
    (a) = (b);
}
template <class T> inline void chmin(T &a, const T &b) {
  if ((a) > (b))
    (a) = (b);
}

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;

template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;

#if defined(PCM) || defined(LOCAL)
#include "lib/dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#define cerrendl 42
#endif
//}}}

int gcd(int a, int b) {
  if (b > a)
    swap(a, b);
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

int lcm(int a, int b) {
  return (a / gcd(a, b)) * b; // overflowしにくいように最初に割り算をする。
}

signed main() {
  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  map<int, int> d;
  rep(i, n) {
    cin >> a[i];
    int v = a[i];
    int c = 0;
    while (v % 2 == 0) {
      v /= 2;
      c++;
    }
    d[c]++;
  }
  if (sz(d) == 1) {
    int L = 1;
    rep(i, n) { L = lcm(L, a[i] / 2); }
    dump(L);
    if (m < L) {
      cout << 0 << endl;
      return 0;
    }
    cout << (m - L) / (2 * L) + 1 << endl;
  } else {
    cout << 0 << endl;
  }
  return 0;
}


Fixed submission:
// template version 1.15
using namespace std;
#include <bits/stdc++.h>

// varibable settings
#define int long long
const int INF = 1e18;

// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)((b)-1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x)                                                                 \
  sort(all(x));                                                                \
  x.erase(unique(all(x)), x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x) - A.begin())
#define posu(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) {
  if ((a) < (b))
    (a) = (b);
}
template <class T> inline void chmin(T &a, const T &b) {
  if ((a) > (b))
    (a) = (b);
}

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;

template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;

#if defined(PCM) || defined(LOCAL)
#include "lib/dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#define cerrendl 42
#endif
//}}}

int gcd(int a, int b) {
  if (b > a)
    swap(a, b);
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

int lcm(int a, int b) {
  return (a / gcd(a, b)) * b; // overflowしにくいように最初に割り算をする。
}

signed main() {
  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  map<int, int> d;
  rep(i, n) {
    cin >> a[i];
    int v = a[i];
    int c = 0;
    while (v % 2 == 0) {
      v /= 2;
      c++;
    }
    d[c]++;
  }
  if (sz(d) == 1) {
    int L = 1;
    rep(i, n) {
      L = lcm(L, a[i] / 2);
      if (L > m)
        break;
    }
    dump(L);
    if (m < L) {
      cout << 0 << endl;
      return 0;
    }
    cout << (m - L) / (2 * L) + 1 << endl;
  } else {
    cout << 0 << endl;
  }
  return 0;
}