BFS function problem

The program returns me 1. I think that there is a mistake in one of the cycles. But I cant find where.

Code:

#include<iostream>
#include<vector>
#include<queue.h>

#define NMAX 1024

using namespace std;

vector <int> a[NMAX];
int n;
int s[NMAX];
void input()
{
int m;
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int u,v;
cin>>u>>v;
a[u].push_back(v);
a[v].push_back(u);
}
}
int used[100];
void bfs(int u)
{
queue<int>q;
q.push(u);

while(!q.empty())
{
u=q.front();
q.pop();
cout<<u<<" ";
for(int j=0;j<a[u].size();j++)
{
int v=a[u][j];
if(s[v]==0);
s[v]=1;
}

}

cout<<endl;
}


int main()
{
input();
bfs(1);
return 0;

}

Indent your code, please.
Remove global variables.

At least he provided a compilable example. It looks like a contest problem.
Anyway, I autoformatted it, compiled, and ran.
You could give at least an example of input, which produces incorrect result.

Try to input
3 3
1 3
1 2
3 1
I think that the result is incorrect.

Code:

if(s[v]==0);
s[v]=1;

1. The first semicolon must be removed
2. You don't push vertices, which are connected to 'u', onto the queue (except 'u' itself at the beginning).

Thak you. Now it's working.