Cod sursa(job #1133665)
| Utilizator | Data | 5 martie 2014 12:09:43 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <string.h>
using namespace std;
const int Nmax = 2000005;
int main()
{
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int N;
f >> N;
int P[Nmax];
memset(P, -1, (N+1)*sizeof(int));
P[0] = P[1] = 0;
for (int i = 2; i*i <= N; i++)
if (P[i])
for (int j = i*i; j <= N; j += i)
P[j] = 0;
int answer = 0;
for (int i = 2; i <= N; i++)
if (P[i]) answer++;
g << answer << endl;
return 0;
}
