OJ Board

my program don't work when the 3 numbers in the input are even and the maze is empty.
ex:
2 2 2
S.
..

..
.E

however I fixed it and got ac.

what is the output if my input is:
3
Input Set #1: YES
Input Set #2: NO
Input Set #3: NO
4
123
ABCDE FG
hij k
lmn
0

Here is my code.
My output format is wrong?
My algorithm is wrong?
I can't figure out.
[c]#include <stdio.h>
#include <stdlib.h>
#define MAX 32767

long l,r,c;
char a[32][32][32];

long queue[MAX][4];
long left,right;
int Add_queue(long,long,long,long);
int Get_queue(long *);

int main()
{
void ...

It passed for the sample cases, but I still get WA.
I use BFS and can't find any problem.

If I use brutal force , I'll get TLE.
If you succeed, please give me a hint.
thanks a lot.

Thanks a lot.
It's my mistake.
I should review my code more carefully.

The first street you are reading is the street where john lives.
Example input:
3 1 6
1 2 1
2 3 2
2 4 3
4 5 4
5 2 5
5 3 9
5 6 7
6 3 8
0 0
1 1 1
0 0
0 0
john lives in street 3 1 at junction 1. Output should be:
1 2 8 7 4 3 5 9 6

1
How could I get a sequence of street numbers is lexicographically ...

I got wa so many times.
I hope someone can give me an example to help me debug my program.

How could I get a sequence of street numbers is lexicographically the smallest ?

Is there any trick in problem 398 ?
I can't find any problem.
My output is totally the same with sample output.
[c]#include <stdio.h>
#include <stdlib.h>

char a[30][30];
char node[30];
int n;
int started=0;

int main()
{
int index;
void Input();
void Display();
void Proceed();
while(1 ...

When I copied my codes from file to Outlook Express 5.
It cut my code like that:
[c]#include <stdio.h>
#include <string.h>

long int mon,day,year;
long now;

int main()
{
char
b[20][10]={"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","mulu
k","ok","chuen","eb","ben","ix","mem","cib ...

That's strange.
I copied my code from here and sent it then I got accept.
But when I sent it from my file then I got wrong answer.
I couldn't find any differences.

I got wrong answer.
I can't find the wrong.

[c]#include <stdio.h>
#include <string.h>

long int mon,day,year;
long now;

int main()
{
char b[20][10]={"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"};
int n ...