Cod sursa(job #2025457)
Utilizator | Data | 22 septembrie 2017 18:43:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,c,j;
bool v[2000001];
int main(){
cin>>n;
c=0;
for(i=4;i<=n;i=i+2)
v[i]=1;
for(i=3;i*i<=n;i=i+2){
if(v[i]==0){
for(j=i*i;j<=n;j=j+i)
v[j]=1;
}
}
for(i=1;i<=n;i=i+2)
if(v[i]==0)
c++;
cout<<c;
return 0;
}