//Think Less do more:-
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define setbit(x) __builtin_popcount(x)
#define scn(t) scanf("%d",&t);
#define lscn(t) scanf("%lld",&t);
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define lrep(i,a,b) for(long long i=a;i<b;i++)
#define endl “\n”
// using namespace __gnu_pbds;
using namespace std;
const ll N=2e7+5;
const ll mod=1000000007;
// typedef tree<ll, null_type, less, rb_tree_tag,
// tree_order_statistics_node_update> pbds;
int main()
{
bitset prime;
prime.set();
prime[0]=0;
prime[1]=0;
// for(ll i=2;i<N;i++)
// prime[i]=1;
for(ll i=2;i<N;i++)
{
if(prime[i])
for(ll j=i*i;j<N;j+=i)
{
prime[j]=0;
}
}
ll t;
cin>>t;
while(t--)
{
ll l,r;
cin>>l>>r;
vector<ll> v;
for(ll i=2;i<=sqrt(r);i++)
{
if(prime[i])
{
// cout<<i<<endl;
v.pb(i);
}
}
ll arr[r-l+1]={0};
for(ll i=0;i<r-l+1;i++)
{
arr[i]=1;
}
for(ll i=0;i<v.size();i++)
{
ll st=((l+v[i]-1)/v[i])*(v[i]);
if(prime[st]==1)
st+=v[i];
// cout<<v[i]<<" "<<st<<endl;
for(ll j=st;j<=r;j+=v[i])
{
arr[j-l]=0;
}
}
for(ll i=0;i<r-l+1;i++)
{
if(arr[i])
{
if(i+l<N)
{
if(prime[i+l])
cout<<i+l<<endl;
else
continue;
}
else
cout<<i+l<<endl;
}
}
cout<<endl;
}
}
///////////////////////////
this is my code for this question (deepak and prime 11) . Can you tell why i get runtime error on two cases
