Cod sursa(job #2309563)
Utilizator | Data | 29 decembrie 2018 12:51:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int i,j,m,n,rs=1;
bool t[1100000];
int main()
{
fin>>n;
for (i=1;((i*i)<<1)+(i<<1)<=n;i++)
if (t[i]==0)
for (j=((i*i)<<1)+(i<<1);(j<<1)+1<=n;j+=(i<<1)+1)
t[j]=1;
for (i=1;i*2+1<=n;i++)
if (t[i]==0) rs++;
fout<<rs;
return 0;
}