Cod sursa(job #2763256)
Utilizator | Data | 12 iulie 2021 18:49:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
bool a[2000005];
int n;
void ciur(int c)
{
int i, j;
for(i = 3; i * i <= c; i += 2)
{
if(a[i] == false)
{
for(j = i * i; j <= c; j += 2 * i)
a[j] = true;
}
}
int k = 1;
for(i = 3; i <= c; i += 2)
{
if(a[i] == false)
{
k++;
}
}
fout << k;
}
int main()
{
fin >> n;
ciur(n);
return 0;
}