Cod sursa(job #1335343)
Utilizator | Data | 5 februarie 2015 14:03:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#define DMAX 2000004
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, nr;
bool ciur[DMAX];
int main()
{
fin>>n;
int i, j;
for(i=2;i*i<=n;i++)
if(!ciur[i])
{
++nr;
for(j=i;j*i<=n;j++)
ciur[j*i]=1;
}
for(;i<=n;i++)
if(!ciur[i])
++nr;
fout<<nr<<'\n';
return 0;
}