OJ Board

My algo in short is this: hash all words into hash-table, for each word generate all possible edit-steps and check hash-table to see if it exists. Build a graph and do DFS. Im sorry the code's huge. :oops:

I don't think that DFS is required to solve this problem. My accepted program is very ...

Man.. I had a stupid mistake. I was printing ":" after k Cycles instead of ';'. I was somehow getting wrong answer rather than presentation error. I guess it's because of the lack of a blank line after the last case. When I changed ':' to ';' in my output, I got presentation error. And putting a ...

I used backtracking to solve this problem and got AC 0.020.

Anyone got AC by naive brute force approach to compare all the possible pairs?

I had to use long long for input in C++. I had a wrong answer when I used int. The problem might be data type you are using. BTW, I'm not familiar with Pascal.

Hey Rushow..

Does your program print newline for each line? When I tried to compile your code, I got an error saying that main() needs return statement. And when I fixed it and run it, output your program generated didn't have newlines at all for each line.

Another thing is that quotes can be ...

Try the following input:
64 open brackets and 64 close brackets.

I think the answer should be Yes, since the maximum string length is 128 according to the description.