Pagini recente » Cod sursa (job #2453299) | Cod sursa (job #3134869) | Cod sursa (job #497360) | Cod sursa (job #2622025) | Cod sursa (job #1253131)
#include <iostream>
#include <fstream>
#include <stdio.h>
using namespace std;
long long i,j,prime,n;
bool Prim[2000001];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
prime=1;
for (i=2;i<=n;i+=2)
{
Prim[i]=true;
}
for (i=3;i<=n;i+=2)
{
if (Prim[i]==false)
{
prime++;
for (j=i+i;j<=n;j=j+i)
Prim[j]=true;
}
}
printf("%d\n", prime);
}