Cod sursa(job #2081308)
Utilizator | Data | 4 decembrie 2017 16:18:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int N = 2000010;
bitset<N> v;
int n,i,ct,j,a;
int main()
{
fin>>n;
v[1]=1;
for(i=4;i<=n;i+=2)v[i]=1;
for(i=3;i*i<=n;i+=2)
if(v[i]==0)
for(j=i*i;j<=n;j=j+2*i)
v[j]=1;
ct=n-v.count();
fout<<ct;
return 0;
}