Cod sursa(job #1011768)
| Utilizator | Data | 17 octombrie 2013 14:19:45 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<stdio.h>
#include<cmath>
using namespace std;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,i,f,s,j;
bool v[2000001]={0};
scanf("%d",&n);
f=(int)sqrt((float)n);
v[0]=v[1]=1;
for (i=2;i<=f;++i)
if (!v[i])
for (j=i*i;j<=n;j+=i)
v[j]=1;
s=0;
for (i=2;i<=n;++i)
if (!v[i])
++s;
printf("%d\n",s);
return 0;
}
