Deepak and prime

#1

mam mera code 10^5 kaliya hi chal raha hai bas. ushe jyaada nahi mam please help me in these problem
#include
#include<math.h>
using namespace std;
void prime(long long int a[],long long int n)
{
for(long long int i=0;i<n;i++)
{
if(i%2!=0)
{
a[i]=1;
}
}
for(long long int i=3;i<=n;i=i=i+2)
{
if(a[i]==0)
{
continue;
}
else
{
for(long long int j=i*i;j<=n;j=j+i)
{
a[j]=0;
}
}
}
a[2]=1;
a[1]=0;
}
int main()
{
long long int a[100000]={0};
prime(a,100000);
long long int j=0;
int c[100000];
for(long long int i=0;i<100000;i++)
{
if(a[i]==1)
{
c[j]=i;
j++;
}
}
int m;
cin>>m;
cout<<c[m];
return 0;
}

#2

@YASHMATHURIA123 #include<bits/stdc++.h>
#include<math.h>
using namespace std;
bool a[100000000]={0};
long long int n=100000000;
void prime()
{
for(long long int i=0;i<=n;i++)
{
if(i%2!=0)
{
a[i]=1;
}
}
for(long long int i=3;i<=n;i=i=i+2)
{
if(a[i]==0)
{
continue;
}
else
{
for(long long int j=i*i;j<=n;j=j+i)
{
a[j]=0;
}
}
}
a[2]=1;
a[1]=0;
}
int main()
{

prime();
long long int j=0;
int c[1000001];
for(long long int i=0;i<100000000&&j<=1000000;i++)
{
if(a[i]==1)
{
c[j]=i;
j++;
}
}
int m;
cin>>m;
cout<<c[m-1];
return 0;
}

1 Like
#3

sir aap ek baari baatao ge ki mera code m kya galat tha

#4

@YASHMATHURIA123 since 10^6th prime number can be upto 10^8 therefore defining an integer array of 10^8 will overflow the program storage space ,so you have to define an boolean array of 10^8 to find all prime number upto 10^8

#5

sir aapka code run kar gaaya magar app please mujhe #include<bits/stdc++.h> k baare m baata sakhte hai kya

#6

@YASHMATHURIA123

1 Like
#7

mere compiler m #include<bits/stdc++.h> support nahi karta tha isliye nahi chaala tha sorry sir but please tell me about #include<bits/stdc++.h>

#8

@YASHMATHURIA123 instead of defining seperate header file for vector,queue,stack etc you can include <bits/stdc++.h> which will automatically include the header file for all this.

1 Like