Cod sursa(job #2713253)
| Utilizator | Data | 27 februarie 2021 15:49:27 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int NMAX = 2000000;
const int NRPRIM = 79000;
bool c[NMAX+5];
int v[NRPRIM+5];
void ciur(int n)
{
c[0]=c[1]=1;
for(int i=4; i<=n; i+=2)
c[i]=1;
for(int i=3; i*i<=n; i+=2)
{
if(c[i]==0)
for(int j=i*i; j<=n; j+=i*2)
c[j]=1;
}
}
int main()
{
int n, m, nr;
fin>>n;
ciur(n);
nr=1;
v[1] =2;
for(int i=3; i<=n; i+=2)
{
if(c[i]==0)
v[++nr]=i;
}
fout<<nr;
return 0;
}
