Cod sursa(job #1162276)
Utilizator | Data | 31 martie 2014 19:02:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <cstdio>
using namespace std;
int n,nr;
char p[2000005];
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;
}