Cod sursa(job #541587)
| Utilizator | Data | 25 februarie 2011 12:21:35 | |
|---|---|---|---|
| Problema | Light2 | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Romanian Master in Mathematics and Sciences 2011, Ziua 1 | Marime | 0.5 kb |
#include <cstdio>
#include <bitset>
#include <iostream>
//brut
using namespace std;
bitset<158860800> v;
int main(){
freopen("light2.in","r",stdin);
freopen("light2.out","w",stdout);
int n,a,x;
int i,j;
scanf("%d%d",&n,&a);
for(i=1;i<=a;++i){
scanf("%d",&x);
for(j=x;j<=n;j+=x)
v[j]=!v[j];
/*for(j=1;j<=n;++j)
cout<<v[j]<<" ";
printf("\n");*/
}
int sol=0;
for(i=1;i<=n;++i)
if(v[i])
++sol;
printf("%d\n",sol);
return 0;
}
