Cod sursa(job #793552)
Utilizator | Data | 3 octombrie 2012 15:21:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
#define N 2000010
using namespace std;
int a[N],p,j,q,n,nr;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(int i=2;i<=n;i++)
{
if(a[i]==0)
{
nr++;
j=i;
q=i;
}
for(;j<=n;j+=q)
a[j]=1;
}
printf("%d\n",nr);
return 0;
}