Is problem 724 able to judge??
Where we can find whether problems can judge or not ??
Thx for ur reply.
Search found 8 matches
- Sat May 15, 2010 11:59 am
- Forum: Volume 7 (700-799)
- Topic: 724 - Reverse
- Replies: 14
- Views: 5490
- Thu Nov 19, 2009 9:59 am
- Forum: Volume 7 (700-799)
- Topic: 713 - Adding Reversed Numbers
- Replies: 142
- Views: 44176
713 - Adding Reversed Numbers
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....
- Sat Nov 07, 2009 3:44 pm
- Forum: Volume 3 (300-399)
- Topic: 387 - A Puzzling Problem
- Replies: 6
- Views: 2958
Re: WA 387
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.
2.Normal cases are not hard for coding. I give 2 critical test cases.
Input
Code: Select all
2
4 4
1111
1111
1111
1111
1 1
1
1
1 1
1
0
Code: Select all
No solution possible
No solution possible
- Sat Oct 31, 2009 3:51 am
- Forum: Volume 115 (11500-11599)
- Topic: 11513 - 9 Puzzle
- Replies: 10
- Views: 5273
Re: 11513 - 9 Puzzle
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...
- Tue Oct 20, 2009 11:25 pm
- Forum: Volume 2 (200-299)
- Topic: 246 - 10-20-30
- Replies: 3
- Views: 3515
Re: 246 WA
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".
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".
- Mon Oct 19, 2009 3:13 am
- Forum: Volume 101 (10100-10199)
- Topic: 10177 - (2/3/4)-D Sqr/Rects/Cubes/Boxes?
- Replies: 10
- Views: 5339
Re: 10177 - (2/3/4)-D Sqr/Rects/Cubes/Boxes?
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.
You can think about rectangle = all - square.
It's not hard to AC 0.000s.
- Sun Oct 18, 2009 5:41 pm
- Forum: Volume 3 (300-399)
- Topic: 351 - "Cheapest" Scores
- Replies: 5
- Views: 2717
Re: 351 - ``Cheapest'' Scores
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.
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.
- Thu Oct 08, 2009 5:52 am
- Forum: Bugs and suggestions
- Topic: 489 - Hangman Judge
- Replies: 1
- Views: 2985
489 - Hangman Judge
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 ...