Cod sursa(job #2088431)
Utilizator | Data | 15 decembrie 2017 10:29:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int x[2000001],n,j,s;
//1 = nu e prim
//0 = e prim
int main()
{
cin>>n;
x[1]=1;
for(int i=4;i<=n;i+=2){
x[i] = 1;
}
for(int i=3;i<=n;i++){
if(x[i]==0){
j=i+i;
while(j<=n){
x[j]=1;
j+=i;
}
}
}
for(int i=1;i<=n;i++){
if(x[i]==0)s++;
}
cout<<s;
return 0;
}