Cod sursa(job #2439910)
| Utilizator | Data | 17 iulie 2019 11:04:12 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
using namespace std;
int E[2000000];
int main()
{
int n, i, j, c = 0;
FILE *in, *out;
in = fopen("ciur.in", "r");
out= fopen ("ciur.out", "w");
fscanf(in, "%d", &n);
for(i = 2; i * i <= n; i++)
{
if(E[i] == 0)
{
for(j = i*i; j <= n; j += i)
E[j] = 1;
}
}
for(i = 2; i <= n; i++)
{
if(E[i]==0)
c++;
}
fprintf(out, "%d", c);
return 0;
}
