Cod sursa(job #3161353)
Utilizator | Data | 26 octombrie 2023 18:26:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<2000003> ciur;
int main()
{
int n,cnt=0;
int i,j;
fin>>n;
ciur[0]=ciur[1]=1;
for(i=4;i<=n;i+=2)
ciur[i]=1;
for(i=3;i*i<=n;i+=2)
if(ciur[i]==0)
for(j=i*i;j<=n;j+=2*i)ciur[j]=1;
for(i=2;i<=n;i++)if(ciur[i]==0)cnt++;
fout<<cnt;
return 0;
}