Pagini recente » Cod sursa (job #1237582) | Cod sursa (job #1558431) | Istoria paginii runda/winners21/clasament | Cod sursa (job #1268231) | Cod sursa (job #1537883)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
bool c[1000];
void ciur(int n)
{
int i,j,lim=sqrt(n);
c[0]=c[1]=1;
for(i=4;i<=n;i+=2) c[i]=1;
for(i=3;i<=lim;i+=2)
if(!c[i])
for(j=i*i;j<=n;j+=(i<<1)) c[j]=1;
}
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,i,count=0;
in>>n;
ciur(n);
for(i=0;i<=n;i++) if(!c[i]) count++;
out<<count;
return 0;
}