Cod sursa(job #526365)
Utilizator | Data | 28 ianuarie 2011 10:21:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
using namespace std;
#define nmax 2000005
int n,i,j,d;char x[nmax];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
x[0]='1';
x[1]='1';
d=0;
for(i=2;i<=n;i++)
{
if(x[i]!='1')
{
for(j=2;j<=n/i;j++)
{
x[i*j]='1';
}
d=d+1;
}
}
printf("%d",d);
return 0;
}