Cod sursa(job #2190155)

Utilizator AndrulianDin Iulian Andrulian Data 29 martie 2018 21:20:58
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int c[(20000000 >> 6) + 10];
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 ; daca 2*i+1 e prim=>multiplii pana la n vor fi 1
    {
        if((c[ i>> 5] & (1 << (i & 31)))==0)   ///daca 2*i+1 e prim
        {
            for(j=((i * i) << 1) + (i << 1); (j << 1) + 1<=n; j+=(i << 1) + 1)
            {
                c[j >> 5]|=(1 << (j & 31));
            }
        }
    }
    for(i=1; 2 * i + 1<=n; ++i)
        if((c[i >> 5]&(1 << (i & 31)))==0)nr++;
    return nr;

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