Pagini recente » Cod sursa (job #2635707) | Cod sursa (job #3178937) | Cod sursa (job #3181358) | Cod sursa (job #54692) | Cod sursa (job #1227926)
#include <fstream>
#include <cmath>
using namespace std;
const int NMAX=100000000;
bool c[NMAX+5];
int np,prime[1000000];
void ciur(int n)
{
int i,j,lim;
c[0]=1;
c[1]=1;
for(i=4;i<=n;i=i+2)
{
c[i]=1;
}
lim=(int)sqrt((double)n);
for(i=3;i<=lim;i=i+2)
if(c[i]==0)
for(j=i*i;j<=n;j=j+2*i)
c[j]=1;
prime[++np]=2;
for(i=3;i<=n;i=i+2)
if(c[i]==0)
prime[++np]=i;
}
int main()
{
int n;
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
ciur(n);
out<<n<<";"<<np<<"\n";
return 0;
}