OJ Board

hi, i read the problem, but i can't understand what it mean.

could anyone explain the sample input and the sample out to me ?

thanks in advance.

hello, i use bfs, first from the target to serch depth=7, and then, search from the beginning.
during the second bfs, everytime i check whether the state has appeared.
at the same time, i use hash.
so, why i even can't pass the sample input.
could someone help me ? thank in advance?

this is my ...

hi, i use BFS to solve this problem. since the max length is not longer than 15, than we can record all the states, also, we must record the length of the string,(because the w string may be shorter than the goal string).
In this way, i use vis[maxstate][15+2],(maxstate=70000).
But i always get TLE ...

hi, i have tested a lot of testcases, and i got the right answer.
but when i submit i got TLE, could someone help me? thx
this is my code:

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<ctype.h>
#include<iostream>
using namespace std;
#define MAX1 50+5
int tc ...

Hi, i tested a lot of testcases and got the same as its output.but when i submit,it always WA. i am puzzling...

can anyone give me some hard testcase or help me find out my wrong place? thx .

this is my code, you can test the datas with it can find out my wrong place? thx .


#include<stdio.h ...

for this problem,i have thought for a whole night,maybe i got the ideal, but i still cannot wrte out the code.

that is i cannot express my ideal with code, could somebody tell me the core code?

thanks in advance.