Cod sursa(job #2102629)

Utilizator n.nadim2001Nofal Nadim n.nadim2001 Data 9 ianuarie 2018 09:56:35
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.41 kb
#include <iostream>
#include <cmath>
#include <fstream>

using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");


int N,i,nrp,p;
bool v[2000000];
int main(){f>>N;
for(i=4;i<=N;i=i+2)v[i]=1;
i=3;
while(i*i<=N){
    for(p=i*i;p<=N;p=p+i*2)v[p]=1;
    i=i+2;}
    for(i=2;i<=N;i++)g<<v[i];
for(i=2;i<=N;i++){if(v[i]==0)nrp++;}
    g<<nrp;
    f.close();
    g.close();

    return 0;

}