Cod sursa(job #2634700)
| Utilizator | Data | 12 iulie 2020 01:08:58 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <stdio.h>
#define NMAX 2000005
using namespace std;
int v[NMAX] = { 0 };
int main()
{
FILE* fin, * fout;
fin = fopen("ciur.in", "r");
fout = fopen("ciur.out", "w");
int n, nr = 0;
fscanf(fin, "%i", &n);
for (int i = 3;i <= n;i+=2) {
if (v[i] == 0) {
++nr;
for (int j = i*i;j <= n;j += i)
v[j] = 1;
}
}
fprintf(fout,"%i", nr);
printf("%i", nr);
return 0;
}