Cod sursa(job #650561)
Utilizator | Data | 18 decembrie 2011 14:02:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<cstdio>
#include<cmath>
int n;int i,j,k;char a[2000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i=i++)
a[i]=1;
k=0;
for(i=2;i<=n;i=i++)
if(a[i]==1)
{
for (j=i+i;j<=n;j+=i)
a[j]=0;
k++;
}
printf("%d\n",k);
return 0;
}