OJ Board

Is problem 724 able to judge??

Where we can find whether problems can judge or not ??

Thx for ur reply.

Hi, administrator: The problem says when u reverse 1200, it becomes from 0021 to 21. If the test case is 1 1200 9 The answer should be 3 Because 21+9 = 30 becomes to 3 (drop 0 out). My first code used 0021 to add 9, and the answer was 300. At the second time, I changed my code, and the answer was 3....

1.I think use DFS is so easy to solve this problem.
2.Normal cases are not hard for coding. I give 2 critical test cases.
Input Output Every piece has to be used.

This is what I did in my AC code: Do a BFS-like algorithm: Have a cache of solutions and a queue. Put in the queue the initial state "123456789" which has solution "" and moves=0 While there are states in the queue: Process the actual state Create all 6 neighbors states If the n...

Does anyone have a efficient method?

I use string and functions like sprintf() and strcmp() to memorize all cards, and got AC 0.392s.

but I thknk this method is too slow to detect "state repeated".

Time is enough to do pre-calculating without prior to key-in table.

You can think about rectangle = all - square.

It's not hard to AC 0.000s.

1. I create a array with size only 1,000,000 characters to do marking.

2.Use dfs to generate relations of events first, then use DP to solve it. Think about coin change.

3.ATTENTION!! If the event has 2 or above, you have to add 's' after event name. See the sample output.

This article is about test cases of 489 - Hangman Judge. Oct 8, 2009 UTC+8 Assume the answer is 'abc'. At first time I guess 'd', and it should be wrong. In the second guessing, I say 'd' again, and the right motion is to do nothing. My first AC code didn't check it, and gave the second guessing as ...