Cod sursa(job #2726048)
Utilizator | Data | 20 martie 2021 09:43:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int ciur[2000001];
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int main(){
int n;
cin>>n; ciur[1]=ciur[0]=1;
for(int i=2;i<=n;i+=1){
if(ciur[i]==0){
for(int j=2;j*i<=n;j++){
ciur[i*j]=1;
}
}
}
int k=0;
for(int i=3;i<=n;i+=2){
if(ciur[i]==0){
k++;
}
}
cout<<k+1;
return 0;
}