Cod sursa(job #930677)
Utilizator | Data | 27 martie 2013 19:36:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
#define N 2000001
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int v[N],n,s;
int ciur(){
int i,j;
v[1]=1;
for(i=1;i<=n;i++){
if(v[i]==0){
for(j=2*i;j<=n;j+=i){
v[j]=1;
}
}
}
}
int main(){
int i;
in>>n;
ciur();
for(i=1;i<=n;i++) if(v[i]==0) s++;
out<<s;
return 0;
}