Cod sursa(job #1901348)
| Utilizator | Data | 3 martie 2017 21:26:55 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <cstdio>
using namespace std;
bool ciur[2000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,i,j,cnt;
scanf("%d",&n);
ciur[0]=true;
ciur[1]=true;
for(i=4;i<=2000000;i=i+2)
ciur[i]=true;
for(i=3;i<=1414;i=i+2)
if(!ciur[i])
for(j=i*i;j<=2000000;j=j+2*i)
ciur[j]=true;
cnt=0;
for(i=2;i<=n;i++)
if(ciur[i]==0)
cnt++;
printf("%d",cnt);
return 0;
}
