Pagini recente » Borderou de evaluare (job #2074583) | Cod sursa (job #1450475) | Borderou de evaluare (job #2854920) | Borderou de evaluare (job #2648106) | Cod sursa (job #540308)
Cod sursa(job #540308)
#include <cstdio>
#include <vector>
using namespace std;
long long N;
int K, d[32];
int main()
{
freopen("light2.in", "r", stdin);
freopen("light2.out", "w", stdout);
scanf("%lld%d", &N, &K);
for (int i = 1; i <= K; ++i)
scanf("%d", &d[i]);
vector<char> *v = new vector<char>(N);
for (int i = 1; i <= K; ++i)
for (int j = d[i]; j <= N; j += d[i])
(*v)[j-1] ^= 1;
long long sol = 0;
for (int i = 1; i <= N; ++i)
sol += ((*v)[i-1] == 1);
printf("%lld\n", sol);
delete v;
return 0;
}