Cod sursa(job #950133)
Utilizator | Data | 15 mai 2013 21:59:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
#include<bitset>
#define DMAX 2000002
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,nr=1;
bitset<DMAX> ciur;
int main()
{
fin>>n;
for(i=3;i<=n;i+=2)
{
for(j=i+i;j<=n;j+=i)
ciur[j]=1;
if(!ciur[i])
++nr;
}
fout<<nr;
return 0;
}