Cod sursa(job #2074256)
Utilizator | Data | 24 noiembrie 2017 12:28:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <bitset>
#include <fstream>
using namespace std;
const int N=2000001;
bitset<N> c;
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
c.set();
int n,i,j,k=0;
in>>n;
for(i=2; i*i<=n; i++)
{
if(c[i])
{
for(j=i*i; j<=n; j+=i)
c[j]=false;
}
}
for(i=2; i<=n; i++)
if(c[i])
k++;
out<<k;
return 0;
}