Cod sursa(job #1617425)
Utilizator | Data | 27 februarie 2016 13:41:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int nmax=2e6;
bool v[nmax+1];
int main () {
int n;
fin>>n;
int sol=0;
for (int i=2; i*i<=n; i++) {
if (v[i]==0) {
for (int j=2*i; j<=n; j+=i) {
v[j]=1;
}
}
}
for (int i=2; i<=n; i++) {
if (v[i]==0) {
++sol;
}
}
fout<<sol<<"\n";
return 0;
}