Search found 570 matches

by Observer
Mon Jun 11, 2007 12:26 pm
Forum: Algorithms
Topic: Minimum cut
Replies: 1
Views: 1864

Hi,

This question has been asked before here. Check this out:
http://online-judge.uva.es/board/viewtopic.php?t=2537

In short, by the famous Maxflow-mincut theorem, you can get a mincut (a partition of the original graph) from a maxflow. Please go through the proof of the theorem again.
by Observer
Thu May 31, 2007 12:33 pm
Forum: Off topic (General chit-chat)
Topic: Joachim Wulff has got 2000 problems solved!!!
Replies: 16
Views: 41255

Congratulations little joey!! You're really a great solver!

And yes, I like the tasks you set very much, especially Ignoring Digits (though I can't find time to attempt all your tasks :oops:).
by Observer
Tue May 22, 2007 8:37 am
Forum: Volume 111 (11100-11199)
Topic: 11148 - Moliu Fractions
Replies: 19
Views: 12301

kolpobilashi, I can tell you that there are NO cases like those...
by Observer
Tue May 15, 2007 9:39 am
Forum: Other words
Topic: The "patented" linked list
Replies: 1
Views: 2350

The "patented" linked list

To those who are interested in copyright issues: see this report about the patented linked list data structure: http://www.google.com/patents?vid=USPAT7028023 Don't just see the title. It is not an ordinary linked list; it is... Please read through the whole report yourself, and see how we all can b...
by Observer
Wed Apr 11, 2007 6:41 am
Forum: Bugs and suggestions
Topic: 10011 Is the rejudgment correct?
Replies: 1
Views: 1790

10011 Is the rejudgment correct?

I still haven't received a mail for "new verdict" for this problem, so I assume that the rejudgment is not final. Anyway, since Carlos said only that some cases are "deleted", it doesn't make sense that most previously Accepted submissions are rejudged as WA. Please have a look at this task. Thanks.
by Observer
Thu Mar 08, 2007 6:10 pm
Forum: Volume 111 (11100-11199)
Topic: 11191 - Square
Replies: 23
Views: 13365

Maybe :D . But I don't have time to do so now. You know, the heavy schoolworks.... :P

And to me, writing programs in PASCAL is as comfortable as talking in my own language. Anyway, will write more C/C++ programs in the coming Easter holiday I think.
by Observer
Thu Mar 08, 2007 6:04 pm
Forum: Volume 111 (11100-11199)
Topic: 11191 - Square
Replies: 23
Views: 13365

Hmm... I sent a code that only reads in the input numbers (with read()) and factorize them with 2, 3, 5, 7, ..., 29. And that gives a TLE...

Also see my old post at: http://online-judge.uva.es/board/viewto ... 4&start=11
by Observer
Thu Mar 08, 2007 5:41 am
Forum: Volume 111 (11100-11199)
Topic: 11191 - Square
Replies: 23
Views: 13365

Well, with the same algorithm I get TLE in PASCAL, and Accepted in around 3 seconds in C. Which is not surprising since int64 computations are very slow in PASCAL.. :-?
by Observer
Thu Mar 01, 2007 5:28 pm
Forum: Volume 111 (11100-11199)
Topic: 11175 - From D to E and Back
Replies: 18
Views: 8759

But doesn't we require D to be a directed graph? I think that means all edges in D should be directed edges.
by Observer
Thu Mar 01, 2007 5:30 am
Forum: Volume 111 (11100-11199)
Topic: 11175 - From D to E and Back
Replies: 18
Views: 8759

Now draw a directed graph where it has nodes namely 0, 1, 2, 3 and making edges as arrows from 0 to 1, from 2 to 1 and from 2 to 3. This graph can be the lying graph from the undirected (or directed both ways) graph with nodes n0,n1,n2,n3,n4 where there's an edge called A between each nA,nA+1 and b...
by Observer
Tue Feb 27, 2007 8:09 am
Forum: Volume 111 (11100-11199)
Topic: 11180 - Base i-1
Replies: 8
Views: 3238

Dont' think too hard. Think of sclo's hint. We got accepted using the same idea.
by Observer
Tue Feb 27, 2007 8:03 am
Forum: Volume 111 (11100-11199)
Topic: 11182 - Zeroes III
Replies: 12
Views: 4692

O(n) is waaay too slow. F2(n) = 1^S(n) . 2^S(n-1) . 3^S(n-2) . ...... . n^S(1) Yes, but since we are only interested in the factors of F2(n) related to input b, many of the terms aren't necessary. Think about it. We got accepted during contest, and NO hard number theory is required. Try also the cas...
by Observer
Mon Feb 26, 2007 5:46 pm
Forum: Volume 111 (11100-11199)
Topic: 11184 - Joyful Ride
Replies: 11
Views: 7141

You can easily prove by odd-even parity that there are no solutions if N = 4*k+1 or 4*k+2.
by Observer
Fri Feb 23, 2007 5:15 pm
Forum: Volume 103 (10300-10399)
Topic: 10329 - Combinatorial Expression
Replies: 11
Views: 5962

Thank you.

I've just got accepted. My mistake was not reading the problem statement properly. :p
by Observer
Fri Feb 23, 2007 2:49 pm
Forum: Volume 103 (10300-10399)
Topic: 10329 - Combinatorial Expression
Replies: 11
Views: 5962

I'm always getting WA..... >_< My BigInteger operation looks okay, so.....

Input:
1 2
1 1
2 2
3 3
1 2
5 5
1 1
2 1
1 1
340 170
2 2
1 1
336 168
4 4
Output:
1
0
-1
6088717586293958420919965582862840857932876070583068946752913884253601825766708971967140661846856600
Is that correct? Please help...

Go to advanced search