Cod sursa(job #2780971)
| Utilizator | Data | 8 octombrie 2021 10:40:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
int n;
const int N = 2000001;
bool sv[N + 1];
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin >> n;
sv[0] = sv[1] = 1;
for(int i = 2; i * i <= n; i++)
{
if(sv[i] == 0)
{
for(int j = i * i; j <= n; j += i)
sv[j] = 1;
}
}
int p = 0;
for(int i = 2; i <= n; i++)
{
if(!sv[i])
p++;
}
cout << p;
return 0;
}
