Cod sursa(job #1322865)
Utilizator | Data | 20 ianuarie 2015 14:34:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<bits/stdc++.h>
using namespace std;
int n;
bitset<2000005> v;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
long long i,j,nr=0;
for(i=2;i<=n;i++)
if(v[i]==0)
{
nr++;
for(j=i*i;j<=n;j=j+i)
v[j]=1;
}
cout<<nr;
return 0;
}