题目链接
解题报告:
直接考虑容斥,在二进制枚举 搞一下就ok。
#define first f
#define second s
#define ll long long
#define pb push_back
#define pii pair<int,char>
#define sl(p) strlen(p)
#define SZ(p) p.size()
#include <bits/stdc++.h>
#define lb lower_bound
#define ub upper_bound
#define mem(a,b) memset(a,b,sizeof(a))
#define fast_cin ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
using namespace std;
const ll MOD=1e9+7;
const int maxn=1e6+5;
const int inf=INT_MAX;
ll p[maxn],q[maxn];
int main()
{
int n;
ll m,ans=0;
scanf("%d%lld",&n,&m);
for(int i=1;i<=n;i++){
scanf("%lld",&p[i]);
}
for(int i=1;i<(1<<n);i++){
int j=i,cnt=0,ant=0;
while(j){
q[++cnt]=j%2;j/=2;
}
ll knt=1;
bool flag=false;
for(int k=1;k<=cnt;k++){
if(q[k]) {
knt*=p[k];ant++;
}
if(knt>m) {
flag=true;break;
}
}
if(flag) continue;
if(ant&1) ans+=m/knt;
else ans-=m/knt;
}
printf("%lld\n",ans);
return 0;
}