Cod sursa(job #2977852)
| Utilizator | Data | 12 februarie 2023 15:52:08 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
string np = "ciur";
ifstream f(np + ".in");
ofstream g(np + ".out");
// #define f cin
// #define g cout
int n, rez;
bool ciur[2000000];
int main()
{
ciur[1] = ciur[0] = 1;
for (int i = 2; i <= 1000000; i++)
ciur[i * 2] = 1;
for (int i = 3; i <= 2000000; i++)
if (!ciur[i])
for (int j = 2; j <= 2000000 / i; j++)
ciur[i * j] = 1;
f >> n;
for (int i = 1; i <= n; i++)
if (!ciur[i])
rez++;
g << rez;
return 0;
}