Cod sursa(job #836953)
| Utilizator | Data | 16 decembrie 2012 22:29:32 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main(){
int N; in>> N;
in.close();
bool* sieve = new bool[N+1];
memset( sieve+2, 1 , sizeof(bool)*(N+1) );
long long count = 0;
for( int i = 2; i <= N; i++ )
if( sieve[i] == 1 )
for( int j = i * i; j <= N; j+=i)
sieve[j] = 0;
for( int i = 2; i <= N; i++ )
if( sieve[i] == 1 )
count++;
out<< count;
out.close();
delete[] sieve;
return 0;
}
