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