Pagini recente » Cod sursa (job #1285605) | Cod sursa (job #556980) | Cod sursa (job #321889) | Cod sursa (job #3152148) | Cod sursa (job #537043)
Cod sursa(job #537043)
#include<iostream.h>
#include<math.h>
#include<fstream.h>
int pr[255],i;
int prim(int j)
{
for(j=2;j<=sqrt(i);j++)
if(i%j==0) return 0;
return 1;
}
int main()
{
int j,n,c=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
f.close();
for(i=1;i<=n;i++)
pr[i]=1;
for(i=2;i<=n;i++)
if(pr[i]!=0 && prim(i))
c++;
else
{pr[i]=0;
for(j=i+i;j<=n;j=j+i)
pr[j]=0;
}
g<<c;
g.close();
return 0;
}