Cod sursa(job #2189783)

Utilizator AndrulianDin Iulian Andrulian Data 28 martie 2018 23:26:57
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int N=100000000/2+1;
char c[N];
int n;
inline int ciur(int n)
{
    int i,j,nr=1;
    for(i = 1; ((i * i) << 1) + (i << 1) <= n; ++i)///((i*i)<<1) <=> 2*i+1
    {
        if(c[i]==0)    ///daca 2*i+1 e prim=>multiplii pana la n vor fi 1
        {
            for(j=((i * i) << 1) + (i << 1); (j << 1) + 1<=n; j+=(i << 1) + 1)
            {
                c[j]=1;
            }
        }
    }
    for(i=1; 2 * i + 1<=n; ++i)
        if(c[i]==0)nr++;
    return nr;

}
int main()
{
    fin>>n;
    fout<<ciur(n);
    //fout<<nr;
    return 0;
}