Cod sursa(job #577023)
Utilizator | Data | 9 aprilie 2011 18:02:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
using namespace std;
bool ciur[2000002];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n;
scanf("%d",&n);
int s=0;
for(int i=2;i<=n;i++)
{
if(ciur[i]==false)
{
s++;
for(int j=i+i;j<=n;j+=i)
ciur[j]=true;
}
}
printf("%d\n",s);
return 0;
}