Cod sursa(job #1161387)
Utilizator | Data | 31 martie 2014 11:06:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <cstdio>
#define nmax 2000005
using namespace std;
int p[nmax],n,nr;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int i,j;
scanf("%d",&n);
for(i=2;i<=n;i++)
{
if(!p[i])
nr++;
for(j=2*i;j<=n;j+=i)
p[j]=1;
}
printf("%d",nr);
return 0;
}