Discussion About Prime Generator

#1

This is Discussion thread about Prime Generator

#2

#include
#include
using namespace std;
bool prime(int a){
if(a<2) return false;
for(int i=2;i<=a/2;i++){
if(a%2==0) return false;
}
return true;
}
int main() {
int test;
cin>>test;
for(int i=1;i<=test;i++){
int c,d;
vector raja;
cin>>c>>d;
for(int j=c;j<=d;j++){
if(prime(j)) raja.push_back(j);
}
int k=raja.size();
for(int s=0;s<k;s++){
if(s==(k-1)) cout<<raja[s]<<endl;
else cout<<raja[s]<<" ";
}

}
return 0;

}
Sample test cases pass and also other.
But what is the issue with hidden test case