Pagini recente » Profil popescuoana | Profil Thomas_Paturan114 | Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #676875)
Cod sursa(job #676875)
#include<iostream>
#include<fstream>
#include<bitset>
using namespace std;
bool v[2000000];
int k,n,i,z;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
z=2;
k=0;
while(z<n/2)
{
for(i=z;i<=n-1;i=i+z)
{
if(v[i]!=1)
{
if(i%z==0 && i!=z)
v[i]=1;
}
}
z=z+1;
while(v[z]==1 && z<n/2)
{
z=z+1;
}
}
for(i=2;i<n;i++)
{
if(v[i]!=1)
{k=k+1;}
}
g<<k;
return 0;
}