Cod sursa(job #1372522)
Utilizator | Data | 4 martie 2015 13:59:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <cstdio>
using namespace std;
int a,b,r,i,n,ciur[20000001],nr,j;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
ciur[i]=1;
}
for(i=2;i<=n;i++)
if(ciur[i]==1)
for(j=i*i;j<=n;j=j+i)
ciur[j]=0;
for(i=2;i<=n;i++)
if(ciur[i]==1)
nr++;
printf("%d",nr);
return 0;
}