Cod sursa(job #1366884)
Utilizator | Data | 1 martie 2015 14:26:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bitset <2000001> v;
int main()
{
int nr=1,i,n,j;
in>>n;
for(i=3;i*i<=n;i+=2)
if(v[i]==0)
for(j=i*i;j<=n;j+=2*i)
v[j]=1;
for(i=3;i<=n;i+=2)
if(v[i]==0)
nr++;
out<<nr;
return 0;
}