#include <bits/stdc++.h> using namespace std; #define REP(i, n) for (int i=0, ___=(n); i<___; ++i) #define FOR(i, a, b) for (int i=(a), ___=(b); i<=___; ++i) #define FORD(i, a, b) for (int i=(a), ___=(b); i>=___; --i) typedef long long ll; typedef pair<int, int> PII; typedef pair<int, ll> PIL; int read() { int n; cin >> n; return n; } ll readl() { ll n; cin >> n; return n; } int tn; ll t[882128]; ll bin(ll mmax) { int a = 0, b = tn; const int x = 3; while (a+x < b) { int c = (x*a + b) / (x+1); if (t[c] <= mmax) a = c; else b = c; } while (a+1 < b) { int c = (a + b) / 2; if (t[c] <= mmax) a = c; else b = c; } return t[a]; } ll rrr; void gen2(const vector<int> &p, int i, ll cur, ll N) { if (i >= p.size()) { rrr = std::max(rrr, cur * bin(N / cur)); return; } gen2(p, i+1, cur, N); while (N / cur >= p[i]) { cur *= p[i]; gen2(p, i+1, cur, N); } } void gen1(const vector<int> &p, int i, ll cur, ll N) { if (i >= p.size()) { t[tn++] = cur; return; } gen1(p, i+1, cur, N); while (N / cur >= p[i]) { cur *= p[i]; gen1(p, i+1, cur, N); } } int main() { int n = read(); ll N = readl(); vector<int> p(n); REP(i, n) p[i] = read(); sort(p.begin(), p.end()); vector<int> p1, p2; REP(i, 5) if (i < n) p1.push_back(p[i]); if (6 < n) p1.push_back(p[6]); FOR(i, 5, n-1) if (i != 6) p2.push_back(p[i]); tn = 0; gen1(p1, 0, 1, N); cerr << "tn: " << tn << "\n"; sort(t, t+tn); rrr = 1; gen2(p2, 0, 1, N); cout << rrr << "\n"; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 | #include <bits/stdc++.h> using namespace std; #define REP(i, n) for (int i=0, ___=(n); i<___; ++i) #define FOR(i, a, b) for (int i=(a), ___=(b); i<=___; ++i) #define FORD(i, a, b) for (int i=(a), ___=(b); i>=___; --i) typedef long long ll; typedef pair<int, int> PII; typedef pair<int, ll> PIL; int read() { int n; cin >> n; return n; } ll readl() { ll n; cin >> n; return n; } int tn; ll t[882128]; ll bin(ll mmax) { int a = 0, b = tn; const int x = 3; while (a+x < b) { int c = (x*a + b) / (x+1); if (t[c] <= mmax) a = c; else b = c; } while (a+1 < b) { int c = (a + b) / 2; if (t[c] <= mmax) a = c; else b = c; } return t[a]; } ll rrr; void gen2(const vector<int> &p, int i, ll cur, ll N) { if (i >= p.size()) { rrr = std::max(rrr, cur * bin(N / cur)); return; } gen2(p, i+1, cur, N); while (N / cur >= p[i]) { cur *= p[i]; gen2(p, i+1, cur, N); } } void gen1(const vector<int> &p, int i, ll cur, ll N) { if (i >= p.size()) { t[tn++] = cur; return; } gen1(p, i+1, cur, N); while (N / cur >= p[i]) { cur *= p[i]; gen1(p, i+1, cur, N); } } int main() { int n = read(); ll N = readl(); vector<int> p(n); REP(i, n) p[i] = read(); sort(p.begin(), p.end()); vector<int> p1, p2; REP(i, 5) if (i < n) p1.push_back(p[i]); if (6 < n) p1.push_back(p[6]); FOR(i, 5, n-1) if (i != 6) p2.push_back(p[i]); tn = 0; gen1(p1, 0, 1, N); cerr << "tn: " << tn << "\n"; sort(t, t+tn); rrr = 1; gen2(p2, 0, 1, N); cout << rrr << "\n"; return 0; } |