Cod sursa(job #1554338)
Utilizator | Data | 21 decembrie 2015 12:02:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <cstdio>
using namespace std;
char a[2000000];
void ciur(int n)
{
for(int i=0;i<n;i++)
a[i]=1;
for(int i=2;i<=n;i++){
int j=2;
while(i*j<=n)
{
a[i*j]=0;
j++;
}
}
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,c=0;
scanf("%d", &n);
ciur(n);
for(int i=2;i<=n;i++)
if(a[i]==1)
c++;
printf("%d",c);
return 0;
}