Cod sursa(job #3286708)
Utilizator | Data | 14 martie 2025 15:53:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int v[2000001],elem[2000001],N;
void eratostene(){
for(int i=2;i<=N;i++){
if(v[i]==0)
elem[i]=elem[i-1]+1;
else
elem[i]=elem[i-1];
for(int j=2*i;j<=N && !v[i];j+=i){
v[j]=1;
}
}
}
int main()
{
cin>>N;
eratostene();
cout<<elem[N];
return 0;
}