Cod sursa(job #2910930)
Utilizator | Data | 25 iunie 2022 22:10:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
#define NM 2000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,k;
bool v[NM+1];
void ciur()
{
v[0]=v[1]=1;
for(i=2; i*i<=NM; i++)
if(v[i]==0)
{
for(j=i*i; j<=NM; j+=i)
v[j]=1;
}
}
int main()
{
ciur();
fin>>n;
for(i=2; i<=n; i++)
if(v[i]==0) k++;
fout<<k;
}