cost数[容斥原理][搜索]

 

---

https://blog.csdn.net/forever_dreams/article/details/83618949

%%% gsj神仙 %%% 

 

---

#include<bits/stdc++.h>
#define N 40
#define ll long long
using namespace std;
int n,m,a[N],ans;
bool cmp(int a,int b){return a>b;}
int gcd(int a,int b){return !b?a:gcd(b,a%b);}
ll Lcm(ll a,ll b){return (ll)a*b/gcd(a,b);}
void dfs(int u,ll lcm,int num){
	if(lcm>m) return;
	if(u>n){
		if(num&1) ans+=m/lcm;
		else if(num) ans-=m/lcm; return;
	}
	dfs(u+1,lcm,num); dfs(u+1,Lcm(lcm,a[u]),num+1);
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	sort(a+1,a+1+n,cmp);
	m-=17; dfs(1,1,0); printf("%d\n",ans+1);
	return 0;
}