Cod sursa(job #1188940)
Utilizator | Data | 20 mai 2014 21:03:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <cmath>
#define MAX 2000005
using namespace std;
int n,k;
bool v[MAX];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(int i=2;i<=sqrt(n);i++)
if(!v[i])
for(int j=i*i;j<=n;j+=i)
v[j]=1;
k=0;
for(int i=2;i<=n;i++)
(!v[i])? k++:0 ;
printf("%d",k);
return 0;
}