Pagini recente » Cod sursa (job #689677) | Cod sursa (job #710260) | Cod sursa (job #2087110) | Cod sursa (job #2749282) | Cod sursa (job #1827891)
#include <fstream>
#include <algorithm>
#include <bitset>
using namespace std;
bitset<2000003>a;
int main()
{
int n,cnt,i,j;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
a[1]=1;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=2;i*i<=n;i++)
if(a[i]==0)
for(j=i*i;j<=n;j=j+i)
a[j]=1;
cnt=0;
for(i=2;i<=n;i++)
if(a[i]==0) cnt++;
fout<<cnt;
fout.close();
return 0;
}