Cod sursa(job #1846593)
Utilizator | Data | 13 ianuarie 2017 16:02:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bitset<1000010> b;
int sol,n,i,j;
int main()
{
f>>n;
int m=sqrt(n)/2+1;
for(i=1;i<=m;i++)
if(!b[i])
{
for(j=2*i*(i+1);j<=m;j+=i)
b[j]=1;
sol++;
}
m=(n+1)/2;
for(i++;i<=m;i++)
if(!b[i])
sol++;
g<<sol;
return 0;
}