## Search found 570 matches

Sat Jan 06, 2007 3:50 pm
Forum: Bugs and suggestions
Topic: 10991
Replies: 2
Views: 1570
Well, I can see the picture in the HTML file...

Maybe it is because we use different browsers? I am using Firefox.
Fri Jan 05, 2007 6:27 pm
Forum: Algorithms
Topic: ask two problems
Replies: 2
Views: 1635
Your first problem is solvable by a modified BFS. Time complexity is O(V+E) (linear).

Your second problem can be solved using suffix tree.
Fri Jan 05, 2007 2:22 pm
Forum: Volume 111 (11100-11199)
Topic: 11148 - Moliu Fractions
Replies: 19
Views: 12327
artie wrote:runerror would never execute if input and code is correct, so why it cause restricted function?
I guess Restrict Function verdict is given in the compile stage.
Thu Jan 04, 2007 12:38 pm
Forum: Volume 9 (900-999)
Topic: 993 - Product of digits
Replies: 19
Views: 12301
Seems that this has been rejudged, and we all get AC~

Maybe 0 is not in the judge input?
Thu Jan 04, 2007 7:16 am
Forum: Volume 9 (900-999)
Topic: 993 - Product of digits
Replies: 19
Views: 12301
Hello,

I am also getting WA. And I believe my code is right.

I also get the same output as yours for the cases you posted.
Wed Jan 03, 2007 4:15 am
Forum: Bugs and suggestions
Topic: Author Statictic
Replies: 54
Views: 13855
Now I see 10323 in my "solved" list. Maybe the list has been regenerated?

But now I count the number of numbers in my "solved" list, and I only get 1237 numbers (instead of 1238)? The problem number missing now is 10000. Is this because the judge is still rebuilding the statistics?
Wed Jan 03, 2007 2:25 am
Forum: Bugs and suggestions
Topic: Author Statictic
Replies: 54
Views: 13855
I think I know. It is 10323 Factorial! You Must be Kidding!!!.
Wed Jan 03, 2007 2:21 am
Forum: Bugs and suggestions
Topic: Author Statictic
Replies: 54
Views: 13855
Hi, In my statistic page: Number of tried problems 1248 Number of solved problems 1238 So I expect to see 1248-1238 = 10 numbers in the "List of tried-but-not-solved problems". But there I can only see 9 numbers 10029 10135 10358 10395 10449 10594 10615 10636 10679 So, what is the 10th tried-but-not...
Tue Jan 02, 2007 8:48 am
Forum: Volume 111 (11100-11199)
Topic: 11149 - Power of Matrix
Replies: 42
Views: 19824
So - can the equation above be generalized for n>1? The answer is YES. Recall that for the formula x^(k+1) - 1 x^k + ... + x + 1 = ----------- x - 1 It does not work for x = 1 (in which case denominator = 0). Now back to the matrix case. The formula below works (you can check it by direct computati...
Tue Jan 02, 2007 7:41 am
Forum: Volume 111 (11100-11199)
Topic: 11153 - Museums
Replies: 16
Views: 9168
About the Dijkstra method: Note that actually you are only interested in the minimum time to reach a certain position having visited some subset of the museums. This hint by Adrian basically describes how we can apply Dijkstra algorithm. :D Thinking about the order this Dijkstra goes (i.e. what case...
Tue Jan 02, 2007 3:34 am
Forum: Volume 111 (11100-11199)
Topic: 11149 - Power of Matrix
Replies: 42
Views: 19824
I think computing A^k recursively also works, but if this is not done properly, then the complexity may increase to O(n^3 (log k)^2).
Tue Jan 02, 2007 3:31 am
Forum: Volume 111 (11100-11199)
Topic: 11150 - Cola
Replies: 43
Views: 22751
Hints needed , do we have a recurrence relation for this problem ? Yes. And that's not hard. :wink: A (maybe) silly hint: Even if you decide to borrow k bottles, it doesn't mean that you have to use all of them !!! You may actually borrow many bottles, use none of them at all, and then return them ...
Tue Jan 02, 2007 3:21 am
Forum: Volume 111 (11100-11199)
Topic: 11151 - Longest Palindrome
Replies: 65
Views: 32934
I know that it was only my fault (i should know that this problem can occur, but i'm solving problem for couple years and never met such situations) and i wrote that none can complain about that, but i suggested to problems setters that in my opinion they should avoid such situations, please don't ...
Tue Jan 02, 2007 3:14 am
Forum: Volume 111 (11100-11199)
Topic: 11153 - Museums
Replies: 16
Views: 9168
Dear coolguy : Please think about that yourself! The point you mentioned is important in getting an acceptable solution for this task. Hint: think how money used is computed. By the way, we have made several judge solutions for this task. The DP one takes 0.2x seconds. Another acceptable solution is...
Mon Jan 01, 2007 10:28 am
Forum: Volume 111 (11100-11199)
Topic: 11150 - Cola
Replies: 43
Views: 22751
is there some simpler recurrence or DP If you think about the two questions I posted above, then you shall get an easy relation. Thinking more deeply will even give you a very very fast method. (Don't post it here because it is a big spoiler!!!) :wink: About your recurrence: what is "n"? If it is t...