OJ Board

Hi,
My code satisfied all the sample inputs, here given. But, still I got wrong answer. I used a code similar to BFS algorithm. The code is here:
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>

using namespace std;


int a,b,f;

int check(vector<int> q[2500])
{
queue<int ...

I try this problem a lot but get wrong answer. May be I have some wrong concept with the problem or wrong code but I cann't fixed it. Can u please help me. Here is my code :

#include<iostream>

using namespace std;

int main()
{
long co[51][51],bo[51][51],gr[51][51];
long x,y,p,m,n,c,d,b,l,t ...

My Code gets WA to the judge, I don't understand where is the problem. Please help me. Here is my code :

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

long p[30001];

long parent(long x)
{
if(p[x]==-1)
return x;
else{
p[x]=parent( p[x]);
return p[x ...

#include<iostream>
#include<cstring>

using namespace std;

int main()
{
long s,i,j,k,l,f;
f=0;
char n[10];
freopen("out.txt","w",stdout);
while(1)
{
cin>>s;
cin>>n;

if(s==0&&n[0]=='0')
break;

k=strlen(n);
for(i=1;i<=2*s+3;i++)
{
for(l=0;l<k;l++)
{
if(n[l]=='1')
{
for(j=1;j ...

My question is if 50000<=min<=max<=200000 then in sample input output how min is greater than max in that problem.
edit: Problem number 11667

Its a really interesting problem to me,it seems very easy at 1st look.But now i got 10 time WA on that and still i cannot understand where my problem is.
I give my code below,plz try to help me with giving correction or any type of tips for the code.