Submission #3545249

---

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> out;
    map<ll,ll> mem;
    //reverse(a,a+q);
    rep(i,q){
        if(a[i]==1)fl=true;
    }
    if(fl){
        Cout(n);
        return 0;
    }
    out[1]=1;
    rep(i,q){
        for(ll j=a[i];j<=n;j+=a[i]){
            if(out[j]==0){
                if(j%a[i]==0){
                out[j]=j/a[i];
                }
                else{
                    out[j]=j;
                }
            }
            else{
                if(out[j]%a[i]==0){
                out[j]/=a[i];
                }
            }
            if(out[j]==1&&mem[j]==0)ans++,mem[j]=1;
        }
    }
    Cout(ans+1);
    return 0;
}

Submission Info

Judge Result