Cod sursa(job #2705263)
Utilizator | Data | 12 februarie 2021 11:52:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long long x,i,j,nr;
bool v[2000001];
int main()
{
fin>>n;
v[1]=1;
for(i=4; i<=n; i+=2)
v[i]=1;
for(i=2; i*i<=n; i++)
if(!v[i])
for(j=2; j*i<=n; j++)
v[j*i]=1;
for(i=1; i<=n; i++)
if(!v[i]) nr++;
fout<<nr;
}