Cod sursa(job #1839180)
Utilizator | Data | 2 ianuarie 2017 16:11:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n, a[2000010], k=0;
int main(){
cin>>n;
for(int i=2; i<=n/2+1; i++){
if(a[i]==0){
int j=2;
while(j*i<=n){
if(a[i*j]==0){
a[i*j]=1; k++;}
j++;
}
}
}
cout<<n-k-1;
return 0;
}