Pagini recente » Cod sursa (job #534629) | Statistici Lazea Iosua (Lazea_Iosua_UVT_FMI) | Cod sursa (job #1819063) | Cod sursa (job #916730) | Cod sursa (job #1690962)
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#define NMAX 2000003
FILE *in, *out;
bool prime[NMAX];
void solve();
int main()
{
in = fopen("ciur.in", "r");
out = fopen("ciur.out", "w");
solve();
return 0;
}
void solve()
{
int n;
int x;
int k,contor=0;
fscanf(in,"%d",&n);
for (int i = 2; i < n; i++)
{
if (prime[i]!=1)
{
contor++;
k = 2;
x = i*k;
while (x < n)
{
prime[x] = 1;
++k;
x = i*k;
}
}
}/*
int contor = 0;
for (int i = 2; i < n;i++)
if (prime[i] == 0)
contor++;
*/
fprintf(out, "%d\n", contor);
}