Cod sursa(job #1034366)
Utilizator | Data | 17 noiembrie 2013 19:51:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bool x[2000001];
int n, i, j, k, l;
int main()
{
cin>>n;
k=1;
q=sqrt(n);
for(i=2; i<=n/2; i++) x[1<<i]=1;
for(i=3; i<=n; i+=2)
if(x[i]==0)
{
k++;
if(i<=l)
for(j=i*i; j<=n; j+=i) x[j]=1;
}
cout<<k;
return 0;
}