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