Cod sursa(job #580671)
Utilizator | Data | 13 aprilie 2011 12:50:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int NMAX = 1 << 17;
int main() {
int N, nrprime = 1;
in>>N;
vector<bool>V(N+1);
for(long i=3;i<=N;i+=2)
{
if(V[i]) continue;
for(long j=i+(i<<1);j<=N;j+=i<<1)
V[j]=true;
nrprime++;
}
out<<nrprime;
return 0;
}