Time limit exceeding in one test case

#1

#include<bits/stdc++.h>
using namespace std;

void prime(int *p,int n)
{
for (long long i=3;i<=n;i+=2)
{

    p[i]=1;
}
for (long long i=3;i<=n;i+=2)
{
	if(p[i]==1)
	{
		for(long long j=i*i;j<=n;j=j+i)
		{
			p[j]=0;
		}
	}
}
p[1]=p[0]=0;
p[2]=1;

}
int main() {
int n;
cin>>n;
int p[n55]={0};
prime(p,n50);
int c=0;
for(long long i=0;;i++)
{
if(p[i]==1)
{ c++;
}
if(c==n)
{
cout<<i<<endl;
break;
}
}
return 0;
}

#2

@rakshitgangwar
Hello rakshit,
store prime numbers in array or vectors(let say p) . and when u want to prime nth prime them simply prime p[n-1] (n-1 because o based indexing)

#3

@rakshitgangwar
image
check the constraints ,
ur sieve size should be larger that 5000000th prime number . so check 5000000th prime number and declare ur sieve size bigger than that.

ur program will work fine even if u ignore my previous comment.