Ok, I might be wrong. But what do you think is the answer for input like: 666 1?

Aren't ALL integers in [1, 10000] are possible answers??
array might be { 666, 666, 666, 666 ... } which does not contradict problem statement, yet any size of N in [1, 10000] will give

"Found item i = 666 in L = 1 comparisons"

right? meaning answer should be "1 1 10000" and not "1 1333 1334"...

I modified the code but still failing at Test#16
#include<iostream>

using namespace std;


int BinarySearch(int N,int i,int l)
{
int mid,p,q,x;
  p = 0;
  q = N-1;
  if(N==0)
  x=1;
  else
  x=0;
  for(;(x<l);x++)
  {
          mid = (p+q)/2;

          if(mid==0)break;
          if(mid<i)
          p = mid +1;
          else
          q = mid -1;

  }

  if((x+1)>=l)
  {
  if(mid==i)
  return 1;
  else
  return 0;
  }
  else
  return 0;

}

int main()
{
int j,k=0,f,com,flag=0,first,second;
cin>>f>>com;
for(j=f+1;j<=10000;j=j+1)
{
flag = BinarySearch(j,f,com);
if(flag==1)
{
first =j;
j = j + 1;
while(BinarySearch(j,f,com)==1&&(j<=10000))
{j=j+1;}
second = j-1;
k++;
flag=0;
}
}
cout<<k<<"\n";
for(j=f+1;j<=10000;j=j+1)
{
flag = BinarySearch(j,f,com);
if(flag==1)
{
first =j;
j = j + 1;
while(BinarySearch(j,f,com)==1&&(j<=10000))
{j=j+1;}
second = j-1;
cout<<first<<" "<<second<<"\n";
flag=0;
}
}


return 0;
}