Cod sursa(job #1918340)
Utilizator | Data | 9 martie 2017 15:02:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <bitset>
using namespace std;
bitset<2000010> vaz;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n,nr=0;
scanf("%d",&n);
for(int i=2;i<=n;i++)
if(!vaz[i])
{
nr++;
if(1LL*i*i<=n)
for(int j=i*i;j<=n;j+=i) vaz[j]=1;
}
printf("%d",nr);
return 0;
}