Cod sursa(job #1542194)
Utilizator | Mihalcea Dragos DragosMihalcea | Data | 5 decembrie 2015 09:27:31 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
#define N 2000001
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bool a[N];
int prim[N];
int main()
{
int n;
cin>>n;
for(int i=4;i<=n;i+=2) a[i] = 1;
for (int i=3;i*i<=n;i+=2)
if(a[i]==0)
for (int j=i*i;j<=n;j=j+2*i) a[j]=1;
int k=0,l=1;
prim[++k]=2;
for (int i=3;i<=n;i+=2)
if(a[i]==0) l++;
cout<<l;
return 0;
}