#include<bits/stdc++.h> #define VAR(i,n) __typeof(n) i = (n) #define loop(i,j,s) for(int i=j;i<s;i++) #define loopback(i,j,s) for(int i=j;i>=s;i--) #define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++) #define pln( x ) cout << x << "\n" #define ps( x ) cout << x << " " #define entr cout << "\n" #define pcnt(i) __builtin_popcount(i) #define ll long long #define pb push_back #define mp make_pair #define ff first #define ss second #define SIZE(c) (c).size() #define ALL(c) (c).begin(), (c).end() using namespace std; typedef vector<int> VI; const int INFTY=20000000; const int MAX=500100; const int MOD=10000000; void coutTab(int* tab,int n){ loop(i,0,n){ cout<<tab[i]<<" "; } cout<<"\n"; } //------------------------------------------ ll N; ll ln; ll maxN=0; vector<ll> prim; void gen(int i,ll n){ if(i==SIZE(prim)) maxN=max(maxN,n); else{ gen(i+1,n); while(n<N){ ln=n; n*=prim[i]; //pln(n); if(n>N||n%ln!=0||ln>n) break; gen(i+1,n); } } } int main(){ ios_base::sync_with_stdio(0); int k; ll a; cin>>k>>N; loop(i,0,k){ cin>>a; prim.pb(a); } sort(ALL(prim)); gen(0,1); pln(maxN); }
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 | #include<bits/stdc++.h> #define VAR(i,n) __typeof(n) i = (n) #define loop(i,j,s) for(int i=j;i<s;i++) #define loopback(i,j,s) for(int i=j;i>=s;i--) #define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++) #define pln( x ) cout << x << "\n" #define ps( x ) cout << x << " " #define entr cout << "\n" #define pcnt(i) __builtin_popcount(i) #define ll long long #define pb push_back #define mp make_pair #define ff first #define ss second #define SIZE(c) (c).size() #define ALL(c) (c).begin(), (c).end() using namespace std; typedef vector<int> VI; const int INFTY=20000000; const int MAX=500100; const int MOD=10000000; void coutTab(int* tab,int n){ loop(i,0,n){ cout<<tab[i]<<" "; } cout<<"\n"; } //------------------------------------------ ll N; ll ln; ll maxN=0; vector<ll> prim; void gen(int i,ll n){ if(i==SIZE(prim)) maxN=max(maxN,n); else{ gen(i+1,n); while(n<N){ ln=n; n*=prim[i]; //pln(n); if(n>N||n%ln!=0||ln>n) break; gen(i+1,n); } } } int main(){ ios_base::sync_with_stdio(0); int k; ll a; cin>>k>>N; loop(i,0,k){ cin>>a; prim.pb(a); } sort(ALL(prim)); gen(0,1); pln(maxN); } |