Cod sursa(job #2510805)

Utilizator DenisONIcBanu Denis Andrei DenisONIc Data 17 decembrie 2019 15:00:15
Problema Light2 Scor 80
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.93 kb
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostream& operator<<(ostream& out, set <T> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, map <T1, T2> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << '(' << p.st << ' ' << p.nd << ')'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define MOD 1000000007
#define zeros(x) x&(x-1)^x
#define fi first
#define se second
#define Nmax 500005
const long double PI = acos(-1);

ll n,k,v[25],DP[1<<22];

int main(){
	freopen("light2.in","r",stdin);
	freopen("light2.out","w",stdout);
    ios::sync_with_stdio(false);
    cin >> n >> k;
    for (int i=1;i<=k;i++) cin >> v[i];

    int mx = 1<<k;
	ll ans = 0, mm, d, cnt;

	for (int i=mx-1;i>=1;i--){
		d = 0; mm = 0;
    	for (int j=0;j<k;j++){
    		if (i & (1<<j)){
    			d = __gcd(mm, v[j+1]);
    			if (mm > n * d / v[j+1]){
    				mm = n + 1;
    				d = 1;
    				break;
    			}
    			if (mm) mm = mm * v[j+1] / d;
    			else mm = v[j+1];
    		}
    	}
    	DP[i] = n / mm;
	}

	for (int j=0;j<k;j++){
		for (int i=mx-1;i>=1;i--){
			if (!(i & (1<<j))){
				DP[i] -= DP[i ^ (1<<j)];
			}
		}
	}

	for (int i=1;i<mx;i++){
		if (__builtin_popcount(i) % 2 == 1){
			ans += DP[i];
		}
	}

    cout << ans << '\n';
    return 0;
}