Well, here goes the code:
[cpp]Got AC.[/cpp]
I've tried with the following test cases:
6
bwwwww
bwbbbb
bbwbbb
bbwwbb
bbwbwb
wwwwwb
2
wb
wb
10
bwwwbwwwww
bwbbwwwwww
bwbwwwwwww
bwbwbbbbbb
bwbwwwwwwb
wbbwbbbbbb
bwbwbwwwww
bwwwbwbwbb
bbbwbbbbbw
wwwwwbwwww
4
bbwb
wwbw
bwwb
wwbb
4
bbwb
wwbw
bbwb
bwww ...
Search found 2 matches
- Sun Aug 31, 2003 8:04 am
- Forum: Volume 2 (200-299)
- Topic: 260 - Il Gioco dell'X
- Replies: 19
- Views: 9333
- Wed Aug 20, 2003 12:26 am
- Forum: Volume 2 (200-299)
- Topic: 260 - Il Gioco dell'X
- Replies: 19
- Views: 9333
260 - Il Gioco dell'X DFS?
I'm using a simple depth first search to get a path of b's from top to bottom. I've tried in many test cases and it give's me the right answers.
I can't see what's wrong! I also tried looking for a w's path, but got WA. Is there any other algorythm that would work for this simple problem? Some test ...
I can't see what's wrong! I also tried looking for a w's path, but got WA. Is there any other algorythm that would work for this simple problem? Some test ...