Submission #5026247

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define MOD 1000000007
#define INF 1000000000000000
#define fi first
#define se second
#define all(v) v.begin(),v.end()
int dx[] = { 0,1,0,-1 }, dy[] = { 1,0,-1,0 };
struct edge { int to, cost; };
int n, q, a[25], ans;
set<int>st;
signed main() {
	cin >> n >> q;
	rep(i, q)cin >> a[i];
	rep(i, (1 << q)) {
		int cnt = 1;
		rep(j, q) {
			if ((i >> j) & 1)cnt *= a[j];
			if (cnt > n)break;
		}
		if (cnt > n)continue;
		int memo = cnt;
		rep(j, q)if (memo % a[j] == 0)memo /= a[j];
		if (memo == 1)st.insert(cnt);
	}
	cout << st.size() << endl;
	return 0;
}

Submission Info

Judge Result