SPOJ Sieve of Eratosthenes

#include <bits/stdc++.h>
using namespace std;
#define n 10000000
long long int p[n],k=1,size;
bool a[n];
long long int prime()
{
long long i,j;
a[0]=a[1]=1;
for(i=4;i<=n;i=i+2)
{
a[i]=1;
}
for(i=3;i<=sqrt(n);i=i+2)
{
for(j=i*i;j<=n;j=j+2*i)
{
a[j]=1;
}
}
p[0]=2;
for(i=3;i<=n;i=i+2)
{
if(a[i]==0)
{
p[k]=i;
//cout<<p[k]<<endl;
k++;
}
}


}

int main()
{
long long int t,u,l,w;
cin>>t;
prime();
for(l=1;l<=t;l++)
{
cin>>u;
cout<<1<<endl;
for(w=0;w<n;w++)
{
if(p[w]>u)
{
break;
}
cout<<p[w]<<endl;
}
}

return 0;
}

Download Coding Interview Book and Get More Tutorials for Coding and Interview Solution: Click Here

Download System Design Interview Book and Get More Tutorials and Interview Solution: Click Here

Do you need more Guidance or Help? Then Book 1:1 Quick Call with Me: Click Here

Share on Google Plus

About Ashadullah Shawon

I am Ashadullah Shawon. I am a Software Engineer. I studied Computer Science and Engineering (CSE) at RUET. I Like To Share Knowledge. Learn More: Click Here