Cod sursa(job #2498676)
Utilizator | Data | 24 noiembrie 2019 10:41:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream ci("ciur.in");
ofstream cou("ciur.out");
int n,v[2000005],cn ;
void Ciur(){
v[2]=0;
for(int i=4;i<=n;i+=2){
v[i]=1;
}
for(int i=3;i*i<=n;i+=2 ){
if(v[i]==0){
for(int j=i*i;j<=n;j+=i ){
v[j]=1;
}
}
}
}
int main()
{
ci>>n;
Ciur();
v[1]=1;
for(int i=1;i<=n;i++){
if(v[i]==0 ){
cn++;
}
}
cou<<cn;
}