Submission #1594233

---

Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
#define ALL(X) X.begin(), X.end()
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef std::pair<LL,LL> PLL;//
typedef std::pair<int,int> PII;//
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){

	LL N;
	int Q;
	cin >> N >> Q;
	vector<int> A(Q);
	for(int i=0;i<Q;++i){
		cin >> A[i];
	}
	
	set<LL> num;
	set<LL>::iterator itr,end;
	num.insert(1);//1は最後まで1
	for(int i=Q-1;i>=0;--i){
		itr = num.begin();
		end = num.end();
		set<LL> next;
		for(;itr!=end;++itr){
			LL now = *itr;
			if( now * A[i] <= N ){
				next.insert( now * A[i] );
			}
			if( now % A[i] != 0){
				next.insert( now );
			}
		}
		num = next;
	}

	LL ans = 0;
	itr = num.begin();
	end = num.end();
	for(;itr!=end;++itr){
		if( (*itr) <= N ){
			++ans;
		}else{
			break;
		}
	}
	cout << ans << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()

Submission Info

Judge Result