| Title |
User |
Message |
Place |
Date Posted |
| Re: Re: conditions? |
zhxl0903 |
when k>n |
ccc96s3 |
Jan 08, 2009 - 1:29:41 am UTC |
| Re: conditions? |
hansonw1 |
How is that possible? |
ccc96s3 |
Jan 08, 2009 - 1:25:09 am UTC |
| conditions? |
zhxl0903 |
do we just output nothing if no patterns fit the given conditions (n and k)? |
ccc96s3 |
Jan 08, 2009 - 1:18:30 am UTC |
| Re: Output |
dAedaL |
Yes. "For each trip, if a passage exists, the output is a single line containing an integer indicating the number of units of oxygen consumed. If a passage does not exist, the output is a single line... |
ccc98s5 |
Jan 06, 2009 - 11:16:15 pm UTC |
| Output |
Bryan |
If there is a passage, are we supposed to output the least amount of oxygen consumed possible? |
ccc98s5 |
Jan 06, 2009 - 10:36:43 pm UTC |
| Re: technique? |
hansonw1 |
Graph Theory is an "umbrella" term - most of the time you don't need to learn anything special to solve these problems. For this problem, you can use recursion, DP, math, BFS, DFS, whatever. Since it... |
ccc99s4 |
Jan 05, 2009 - 9:11:50 pm UTC |
| Re: Problems page |
hansonw1 |
I dunno, the way I see it Users Solved is a good measure of how difficult something is, while Accepted % is a good measure of how tricky a problem is. |
General |
Jan 05, 2009 - 9:02:58 pm UTC |
| Re: technique? |
bbi5291 |
You do need to use graph theory, it's just that some graph theory algorithms are also classified as DP. The archetypal example is the Floyd-Warshall all-pairs shortest path algorithm. |
ccc99s4 |
Jan 05, 2009 - 3:17:08 pm UTC |
| Re: Problems page |
bbi5291 |
Acc% is not always the best indication of a problem's difficulty, especially if it's so hard that only very few people know how to do it, but they manage to solve it within very few tries. How about ... |
General |
Jan 05, 2009 - 3:12:51 pm UTC |
| Re: why do half the people that solved this have 30 |
taimla101 |
well it should |
ccc01s3 |
Jan 05, 2009 - 2:03:58 pm UTC |
