Pagini recente » Cod sursa (job #1713170) | Cod sursa (job #2445921) | Cod sursa (job #2624712) | Cod sursa (job #3261187) | Cod sursa (job #710735)
Cod sursa(job #710735)
#include<iostream>
#include<math.h>
#include<fstream>
#include<string.h>
#include<stdio.h>
#include<assert.h>
using namespace std;
int main(void)
{
int n,prim = 0;
int i, j;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
bool* eratostene = new bool[n];
for (i = 0; i <= n; i++)
eratostene[i] = true;
for (i = 2; i <= n; i++)
if (eratostene[i])
{
prim++;
for(j = i+i; j <= n; j += i)
eratostene[j] = false;
}
printf("%d", prim);
return 0;
}