Cod sursa(job #1978694)

Utilizator petrasromanPetras Roman petrasroman Data 8 mai 2017 17:04:40
Problema Ciurul lui Eratosthenes Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <fstream>

using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,v[2000000+3],k;
int main()
{
    f>>n;
    for(int i=3;i<=1415;i+=2)
    {
        if(!v[(i-1)/2])
        {
            int j=i;

            while(i*j<n)
            {

                v[(i*j-1)/2]=1;
                j+=2;
            }

        }
    }
    for(int i=1;i<n/2;i++)
    if(!v[i])
    k++;
    //g<<i<<"="<<v[i]<<"="<<2*i+1<<" ";
    g<<++k;
    return 0;
}