Cod sursa(job #1772062)
| Utilizator | Data | 6 octombrie 2016 14:41:32 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <bitset>
using namespace std;
#define Nmax 2000002
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset< Nmax > Mark;
int prime = 1;
void Ciur(int N){
for (int i = 3; i <= N; i += 2){
if (!Mark[i]){
prime++;
for (int j = i + i; j <= N; j += i)
Mark[i] = 1;
}
}
}
int main(){
int N;
fin >> N;
Ciur(N);
fout << prime;
return 0;
}