Submission #3545385

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9,MOD = 1e9+7,ohara = 1e6;
const ll LINF = 1e18;
using namespace std;

#define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrrep(i,a,b) for(ll i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl

ll n,cnt=0,ans=0,a[ohara],b,c,d,cmp,cmpp,m,h,w,x,y,sum=0,pos,q;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};

//-------------------------↓↓↓↓↓↓------------------------

int main(void){
       cin.tie(0);
    ios::sync_with_stdio(false);
      
    cin>>n>>q;
    rep(i,q)cin>>a[i];
    map<ll,ll> mem;
    ll be[ohara];
    ll cntt=0;
    for(int bit=0;bit<(1<<(q));bit++){
        cnt=1;
        rep(j,q){
            if(bit&(1<<j)){
            cnt*=a[j];
            if(cnt>n)break;
            }
        }
        if(cnt>n)continue;
        if(mem[cnt]==1)continue;
        be[cntt++]=cnt;
        mem[cnt]=1;
    }
    ans=cntt;
    set<ll> st;
    rep(i,cntt){
        while(1){
            bool ok=true;
            rep(j,q){
                if(be[i]%a[j]==0)be[i]/=a[j],ok=false;
            }
            if(ok)break;
        }
        if(be[i]!=1)ans--;
    }
    Cout(ans);
    return 0;
}

Submission Info

Judge Result