Cod sursa(job #1224659)
Utilizator | Data | 31 august 2014 15:58:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <cmath>
using namespace std;
int n,i,j,nr,lim;
char vaz[2000010];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d",&n);
lim=sqrt(n);
for(i=2;i<=n;i++)
if(!vaz[i])
{
nr++;
if(i<=lim)
for(j=i*i;j<=n;j+=i) vaz[j]=1;
}
printf("%d",nr);
return 0;
}