Cod sursa(job #2560434)
Utilizator | Data | 27 februarie 2020 23:32:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int N,i,j,nrp;
fin >> N;
bool v[N] = {0};
nrp=0;
for (i=2; i<=N; i++)
{
if (v[i]==0)
{
nrp=nrp+1;
}
for (j=1; j<=N/i; j++)
v[i*j]=1;
}
fout << nrp;
return 0;
}