Pagini recente » Cod sursa (job #2496250) | Cod sursa (job #1880676) | Cod sursa (job #2106978) | Cod sursa (job #2475872) | Cod sursa (job #1010609)
#include <fstream>
#include <math.h>
using namespace std;
/*int verifica(long x){
long j=0;
long ok=0;
if(x%2==0)
return 0;
else{
for(j=3;j<=sqrt(x);j++)
if(x%j==0)
ok=1;
if(ok==0)
return 1;
else return 0;
}
}*/
int main()
{
long long n,i,j;
char prim[2000000];
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
/*long cont=2;
for(i=4;i<=n;i++){
cont=cont+verifica(i);
}*/
long long count=0;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++){
if(prim[i]==1){
count++;
for(j=i+i;j<=n;j=j+i)
prim[j]=0;
}
}
g<<count;
return 0;
}