Cod sursa(job #574311)

Utilizator cernat.catallinFMI Cernat Catalin Stefan cernat.catallin Data 7 aprilie 2011 01:04:53
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
    ofstream g ("ciur.out");
    ifstream f ("ciur.in");
    char p[2000005];
    long n;
    int nr=0;
    float rad;
    f>>n;
    f.close();
    for(int i=1;i<=n;i++) p[i]=0;
    rad=sqrt(n);
    for(int i=1;2*i+2*i<=rad;i++) //2*i+1
    {
        if(p[i]==0)
        {
            for(int j=2*i*i+2*i;2*j+1<=n;j+=2*i+1) p[j]=1;
        }
    }
    for(int i=1;2*i+1<=n;i++) if(p[i]==0) nr++;
    g<<nr;
g.close();
}