Submission #21248311

---

Source Code Expand

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = 3.14159265359;
const ll INF = 1LL << 60;

ll p[15] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};

ll gety(int bm){
  ll r = 1;
  for (int i = 0; i < 15; i++){
    if (bm&1){
      r *= p[i];
    }
    bm >>= 1;
  }
  return r;
}

long long gcd(long long a, long long b)
{
  long long x = abs(a);
  long long y = abs(b);
  while (y > 0){
    long long r = x % y;
    x = y;
    y = r;
  }
  return x;
}

int main()
{
  int n;
  cin >> n;

  vector<ll> x(n);
  for (ll& t : x) cin >> t;

  ll ans = INF;
  for (int bm = 0; bm < (1 << 15); bm++){
    ll y = gety(bm);
    bool ok = true;
    for (ll xi : x){
      if (gcd(xi, y) == 1){
	ok = false;
	break;
      }
    }
    if (ok){
      ans = min(ans, y);
    }
  }

  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result