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