Cod sursa(job #1799626)
Utilizator | Data | 6 noiembrie 2016 16:13:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,v[2000001],s;
int main (){
cin>>n;
i=2;
for(i=2;i<=n;i++){
if(v[i]==0)
for(j=i*i;j<=n;j=j+i){
v[j]=1;
}
}
s=1;
for(i=3;i<=n;i+=2)
if(v[i]==0)
s++;
cout<<s;
return 0;
}