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