Cod sursa(job #2084319)
Utilizator | Data | 8 decembrie 2017 22:26:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin ( "ciur.in");
ofstream fout("ciur.out");
int N,i,j,p,nrp=0;
fin>>N;
bool v[N+1];
v[0]=false;
v[1]=false;
for(i=2;i<=N;i++)
v[i]=true;
for(i=2;i<=N;i++){
if(v[i]==true){
p=i;
for(j=i+p;j<=N;j=j+p)
v[j]=false;
}
}
for(i=1;i<=N;i++)
if(v[i]==true)
nrp++;
fout<<nrp;
fin.close();
fout.close();
return 0;
}