Cod sursa(job #1416574)
Utilizator | Data | 8 aprilie 2015 14:34:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#define MAX 2000001
using namespace std;
int prim[MAX];
int ciur(int n)
{
int nr = 1;
for(int i = 3; i <= n; i+=2)
{
if(prim[i] == 0){
nr++;
for(int j = i+i+i; j <= n; j+= i << 1)
prim[j] = 1;
}
}
return nr;
}
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
fin >> n;
fout << ciur(n) << '\n';
return 0;
}