Cod sursa(job #1188141)
Utilizator | Data | 18 mai 2014 23:15:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
#define LIM 2000000
using namespace std;
bool p[LIM+10];
void ciur()
{
int i,j;
for(i=2;i<=LIM;++i)
if(p[i]==0)
for(j=i+i;j<=LIM;j=j+i)
p[j]=1;
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,rasp=0;
scanf("%d",&n);
ciur();
for(int i=2;i<=n;++i)
if(p[i]==0)
rasp++;
printf("%d",rasp);
return 0;
}