Search found 7 matches
- Thu Apr 12, 2007 7:05 am
- Forum: Volume 111 (11100-11199)
- Topic: 11151 - Longest Palindrome
- Replies: 65
- Views: 34916
- Tue Apr 10, 2007 9:25 am
- Forum: Volume 111 (11100-11199)
- Topic: 11198 - Dancing Digits
- Replies: 16
- Views: 8549
Re: how you can use BFS?
.. still i dont understand why it is meant by state. i tried to use insertion sort algorithm, but got WA. can you explain a bit more how I can use graph??sclo wrote: Here, it is not hard to see what the states are and how to go from one state to another state.
- Tue Apr 10, 2007 7:44 am
- Forum: Java
- Topic: Anyone knows how to speed up JAVA a little bit?
- Replies: 9
- Views: 7808
- Mon Apr 09, 2007 7:04 pm
- Forum: Volume 111 (11100-11199)
- Topic: 11151 - Longest Palindrome
- Replies: 65
- Views: 34916
TLE
getting TLE, any idea?? :evil:
would appreciate some help on it, looking forward to write in C if it helps!![code]code removed.. even though not accepted yet!! [/code]
would appreciate some help on it, looking forward to write in C if it helps!![code]code removed.. even though not accepted yet!! [/code]
- Mon Apr 09, 2007 9:06 am
- Forum: Off topic (General chit-chat)
- Topic: What is your record of solved problems during one day?
- Replies: 18
- Views: 70340
- Mon Apr 09, 2007 9:04 am
- Forum: Off topic (General chit-chat)
- Topic: What game do you like best?
- Replies: 17
- Views: 63034
- Mon Apr 09, 2007 7:43 am
- Forum: Volume 111 (11100-11199)
- Topic: 11198 - Dancing Digits
- Replies: 16
- Views: 8549
how you can use BFS?
Hi I have been in acm site for 1 week. so i am pretty novice.
i cannot understand the fact how you can use BFS or a Graph for instance in this problem? can anyone explain in brief? :D
i cannot understand the fact how you can use BFS or a Graph for instance in this problem? can anyone explain in brief? :D