Cod sursa(job #1380274)
| Utilizator | Data | 7 martie 2015 05:23:48 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int NLIM = 2000005;
bool isPrime[NLIM];
int N, answer;
void Read()
{
fin >> N;
for(int i = 2; i <= N; i++)
isPrime[i] = true;
for(int i = 2; i <= N; i++)
{
if(isPrime[i])
{
answer += 1;
for(int d = i + i; d <= N; d += i)
isPrime[d] = false;
}
}
fout << answer;
}
int main()
{
Read();
return 0;
}
