Cod sursa(job #1480385)
Utilizator | Data | 2 septembrie 2015 15:27:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <bitset>
#define N 1000010
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,cnt=1,start,step;
bitset<N> viz;
int main()
{
f>>n;
n=(n-1)/2;
for(i=1;2*i*i+2*i<=n;i++)
if(!viz[i])
{
cnt++;
start=2*i*i+2*i;
step=2*i+1;
for(j=start;j<=n;j+=step)
viz[j]=1;
}
for(;i<=n;i++)
if(!viz[i])
cnt++;
g<<cnt<<"\n";
return 0;
}