ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board
Discussion of Problem
1143
. Electric Path
It's not very hard to make a O(N^2) algorithm...
Posted by
Fu Jieyun
5 Apr 2004 18:21
The most important thing here is to understand the problem well. After that all are very easy. I got AC soon after I make clear about the meaning of the problem...
© 2000–2024
Timus Online Judge Team
. All rights reserved.