Cod sursa(job #913661)
Utilizator | Data | 13 martie 2013 17:59:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
#define MAX 2000001
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int p[MAX],n;
void ciur()
{
int i,j;
p[1]=1;
for(i=2;i*i<=MAX;i++)
if(p[i]==0)
for(j=2;i*j<=MAX;j++)
p[i*j]=1;
}
int main()
{
int i,r=0;
ciur();
fin>>n;
for(i=2;i<=n;i++)
if(p[i]==0) r++;
fout<<r;
fin.close();
fout.close();
return 0;
}