Pagini recente » Cod sursa (job #2809394) | Cod sursa (job #2012457) | Borderou de evaluare (job #3212683) | Borderou de evaluare (job #3212274) | Cod sursa (job #2012454)
#include <bits/stdc++.h>
using namespace std;
FILE *F=fopen("ciur.in", "r"), *G=fopen("ciur.out", "w");
int n, a[2000005], k;
int main()
{
fscanf(F, "%d", &n);
a[1] = a[0] = 1;
for(int i = 2; i*i <= n; ++ i)
if(!a[i])
for(int j = i*i; j <= n; j += i)
a[j] = 1;
for(int i = 1; i <= n; ++ i)
if(!a[i]) k++;
fprintf(G, "%d", k);
return 0;
}