Pagini recente » Cod sursa (job #799223) | Cod sursa (job #521607) | Cod sursa (job #425908) | Cod sursa (job #1332132) | Cod sursa (job #983442)
Cod sursa(job #983442)
#include <fstream>
#include <cmath>
#include <bitset>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bitset <2000000> a;
int b[2000000],u,i,j;
int main()
{
f>>u;
for (i=3;i<=sqrt(u);i+=2)
for (j=i*i;j<=u;j+=i)
a[j]=1;
b[2]=1;
for (i=3;i<=u;i++)
if (a[i]==0 && i%2)
b[i]=b[i-1]+1;
else
b[i]=b[i-1];
g<<b[u];
f.close();
g.close();
}