Cod sursa(job #1218935)
Utilizator | Data | 12 august 2014 22:14:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
using namespace std;
bool a[2000003];
int i,j,k,n;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for (i=2; i<=n; ++i)
if (a[i]==0)
for (j=2; j<=n/i; ++j) a[i*j]=1;
for (i=2; i<=n ; ++i)
if (a[i]==0) k++;
printf("%d",k);
}