Cod sursa(job #2999160)
Utilizator | Data | 10 martie 2023 15:48:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
short v[2000005];
int n, cnt;
void sieve(){
v[0]=v[1]=1;
int i;
cnt=1;
for(i=4; i<=n; i+=2) v[i]=1;
for(i=3; i<=n; i+=2){
if(!v[i]){
cnt++;
for(int j=2*i; j<=n; j+=i) v[j]=1;
}
}
}
int main()
{
fin>>n;
sieve();
fout<<cnt;
return 0;
}