Cod sursa(job #494761)
Utilizator | Data | 22 octombrie 2010 20:07:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<cstdio>
using namespace std;
void read();
void solve();
int n,v[2000000],x,i,j;
int main()
{
read();
solve();
}
void read()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
}
void solve()
{
for(i=2;i<n;i++)
if(v[i]==0)
{
x++;
for(j=i+i;j<=n;j+=i)
v[j]=1;
}
printf("%d",x);
}