Cod sursa(job #616909)
Utilizator | Data | 13 octombrie 2011 17:22:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
#include<math.h>
using namespace std;
int a[2000005],n,nr;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
int i,j;
for(i=2;i<=n;i++)
a[i]=1;
for(i=2;i<=n;i++)
{
if(a[i]!=0)
++nr;
for(j=i+i;j<=n;j+=i)
a[j]=0;
}
printf("%d\n",nr);
return 0;
}