Cod sursa(job #1315833)
Utilizator | Data | 13 ianuarie 2015 09:54:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <cstdio>
using namespace std;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
bool prim[2000005];
int i,j,n,nrprim=0;
scanf("%d",&n);
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i]==1)
{
nrprim++;
for(j=i+i;j<=n;j+=i)
prim[j]=0;
}
printf("%d",nrprim);
return 0;
}