Cod sursa(job #2546403)
| Utilizator | Data | 14 februarie 2020 10:02:37 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include<cmath>
#define dim 2000005
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool c[2000000];
int main()
{
int n,nr=0;
in >> n;
for (int i = 2; i <= sqrt(n); i++)
{
if (c[i] == 0)
{
for (int j = i * i; j <= n; j += i)
c[j] = 1;
}
}
for (int i = 2; i <= n; i++)
if (c[i] == 0)
nr++;
out << nr;
return 0;
}
