Cod sursa(job #1682618)
Utilizator | Data | 10 aprilie 2016 12:25:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bool ok[2000005];
int eratosthene(int n){
int contor=0;
int i;
for(i=2;i<=n;i++){
if(ok[i]==0){
++contor;
for(int j=i+i;j<=n;j+=i)
ok[j]=1;
}
}
return contor;
}
int main(){
int n;
cin>>n;
cout<<eratosthene(n);
return 0;
}