Cod sursa(job #307838)
| Utilizator | Data | 25 aprilie 2009 11:00:57 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
int n,i,j,sol;
char a[2000010];
void readd(),solve();
int main()
{
readd();
solve();
return 0;
}
void readd()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
}
void solve()
{
for(i=2;i*i<=n;i++)
if(a[i]==0)
for(j=i*i;j<=n;j=j+i)
a[j]=1;
for(i=2;i<=n;i++)
if(a[i]==0)
sol++;
printf("%d",sol);
}
