Cod sursa(job #1179731)
Utilizator | Data | 29 aprilie 2014 09:40:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <cmath>
using namespace std;
#define MAX 100000001
char v[MAX];
int n, nr;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int i, j, lim;
fin>>n;
nr = 1;
lim = sqrt(n);
for(i=3; i<=lim; i=i+2)
if(!v[i]){
for(j=i*i; j<=n; j=j+i+i)
v[j] = 1;
nr++;
}
for( ;i<=n; i=i+2)
if(!v[i]) nr++;
fout<<nr;
return 0;
}