Cod sursa(job #2037874)
Utilizator | Data | 12 octombrie 2017 21:48:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<math.h>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n,k;
bool a[2001000];
int main() {
cin>>n;
for (int i=2; i<=sqrt(n); i++) {
if (!a[i]) {
for (int j=2; j*i<=n; j++) {
a[i*j]=1;
}
}
}
for (int i=2; i<=n; i++) {
if (!a[i]) k++;
}
cout<<k;
return 0;
}