Cod sursa(job #1839556)
Utilizator | Data | 3 ianuarie 2017 00:52:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,m,i,j,d,v[2000001],w[101],s;
int main() {
in>>n;
for(i=2;i<=n;i++){
if(v[i]==0){
for(j=i+i;j<=n;j=j+i){
v[j]=1;
}}
}
for(i=2;i<=n;i++){
if(v[i]==0){
s++;
}
}
out<<s;
return 0;
}