Cod sursa(job #1227926)

Utilizator SenorCactusBogdan Paicu SenorCactus Data 12 septembrie 2014 10:58:13
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>
#include <cmath>
using namespace std;

const int NMAX=100000000;
bool c[NMAX+5];
int np,prime[1000000];
void ciur(int n)
{
    int i,j,lim;
    c[0]=1;
    c[1]=1;
    for(i=4;i<=n;i=i+2)
    {
        c[i]=1;
    }
    lim=(int)sqrt((double)n);
    for(i=3;i<=lim;i=i+2)
        if(c[i]==0)
            for(j=i*i;j<=n;j=j+2*i)
                c[j]=1;
    prime[++np]=2;
    for(i=3;i<=n;i=i+2)
        if(c[i]==0)
            prime[++np]=i;
}

int main()
{
    int n;
    ifstream in("ciur.in");
    ofstream out("ciur.out");
    in>>n;
    ciur(n);
    out<<n<<";"<<np<<"\n";
    return 0;
}