OJ Board

I got some problem from 10704

(1). is the exit always at right side?
(2). when you use BFS, do you use the branch :
1 position to the right, 2 positions to the right, or 3 positions to the right
or
you directly move the block to the bottom?
(3). Is there exist any solution that I need to move ...

thanks for your reply

but i didn't met the problem when i use the old judge system

thank you anyway

I don't know what happen to the new judge

I have submitted about 20 times of the problem

every time, I got a runtime error

even i use the following code, i still get runtime error:

i think the following code will not get runtime error, but it still occurs.


#include <stdio.h>

int main()
{
int ...

I always got TLE

Is there any more efficient way to generate the number list ?

My algorithm is:

generate the list and sort it by qsort and got TLE

that's my input and output, but i got wrong answer with 0.002 seconds

input:
sew ( turn(
sew(B,turn(B))),
turn(sew (turn(B),B))) ;





sew(turn(sew(B,turn(B))),A);
sew(turn (sew(A,turn(A))),
turn(turn(

turn(sew(A,turn( A ) ) ) ) ))

;

sew(A
, B ) ;
turn(B);
A;
B;



turn sew ...

there must be something wrong with the given table

it says:
A and B represent the two primitive quilts. Each primitive quilt corresponds to a matricial arrangement of 2 x 2 characters.

but the table says:
A: it's right
/ /
/+

B: it's wrong
-
-

I think B should be :
--
--

i got WA, but the run time is only 0.006 second

why??

this is part of my code of scan file
int pile[8][52];

while(1)
{
scanf("%d", &pile[0][0]);
if(pile[0][0] == 0)
{
break;
}
else
{
for(i=1;i<52;i++)
{
scanf("%d", &pile[0] );
}
........continue
}
}

well...i need a direct answer. i have no idea where i get wrong.
someone who thought he/she is one of the best programmer. help me please

#include <stdio.h>

char light[3][3];
int light_button[9], grid[5][5], step[25], ans[25];
int bound, row, column;
void initialize();
void toggle(int i, int j ...

i use eulerian circuit to solve this question
but i got a problem
I have some problem when i got a vertex, this vertex has more than two edges, my code will choose the smallest num of vertex to put in the stack, but i think this is wrong

ex. when i got node 2, this node has edge 1, 2, 3, 4, 5. what ...

thank you very much

i got AC

thanks

but i think that it should give me presentation error not wrong answer

this is my source code, i don't know where gets wrong. it always give me WA. somebody help me, please. i have considered the 0<= L <=50.

#include <stdio.h>

int train[50] = {0};

int bubble_sort(int length);
void swap(int *a, int*b);

int main()
{
int i, j, L;
int N, optimal;

scanf("%d", &N ...