Submission #1246980

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
  ll n,m;
  cin >> n >> m;
  ll a[m];
  for(int i=0;i<m;i++) cin >> a[i];
  set<ll> s;
  for(int t=1; t<(1<<m); t++) {
    ll x=1;
    for(int i=0; i<m; i++) {
      if(t&(1<<i)) x*=a[i];
      if(x>n) break;
    }
    if(x>n) continue;
    ll y=x;
    for(int i=0; i<m; i++) {
      if(t&(1<<i)) y/=a[i];
      else if(y>1&&y%a[i]==0) y=0;
    }
    if(y) s.insert(x);
  }
  cout << s.size() << endl;
  return 0;
}

Submission Info

Judge Result