Cod sursa(job #541435)
Utilizator | razyelx razyelx | Data | 25 februarie 2011 11:14:15 |
---|---|---|---|
Problema | Light2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Romanian Master in Mathematics and Sciences 2011, Ziua 1 | Marime | 0.51 kb |
#include <fstream.h>
#define N 1000000000001
ifstream fin("light2.in");
ofstream fout("light2.out");
char light[N];
long long n,k,nr,max=-1;
void ciur(){
long i,j;
for(i=1;i<=max;++i)
if(light[i])
for(j=2;j*i<=n;++j)
light[j*i] = 1-light[j*i];
for(i=1;i<=n;++i)
if(light[i])++nr;
}
int main(){
int i,di;
fin>>n>>k;
for (i=1; i<=k; i++){
fin>>di;
light[di] = 1;
if (di > max) max = di;
}
ciur();
fout<<nr;
return 0;
}