http://www.qbyte.org/puzzles/p003s.html
On 4/23/06, Venkatesh Dayalan [EMAIL PROTECTED] wrote:
Two unknowns x and y are to be found by two mathematicians M1 and M2.
I give the Product(x * y) to M1 and Sum(x + y) to M2.
M1 doesn't know the value of S and M2 doesn't know the value of P.
Now both
-- Forwarded message --From: [EMAIL PROTECTED]
[EMAIL PROTECTED]Date: Apr 23, 2006 12:57 PMSubject: Posting error: Algorithm GeeksTo: [EMAIL PROTECTED]You do not have permission to post to group algogeeks. You may need to join
the group before being allowed to post, or this group
Hi,
an equivalent defintion is: A graph is k-connected if for each
pair of vertices u and v there exists k disjoint paths from u to
v.
Thus, a simple algorithm could be the following:
for each pair u,v do
search k disjoint paths from u to v
od
Regards,
Daniel
Mohammad Moghimi wrote:
Hi
what is its time complexity?On 4/23/06, Daniel Etzold [EMAIL PROTECTED] wrote:
Hi,an equivalent defintion is: A graph is k-connected if for eachpair of vertices u and v there exists k disjoint paths from u tov.Thus, a simple algorithm could be the following:for each pair u,v do
search k disjoint
We have O(n^2) pairs.
A path from u to v can be found with a simple BFS in O(n+m)
When a path has been found we remove that path from the graph.
This has to be done k times.
Thus, searching for k paths is possible in O(k(n+m)).
Doing this for each pair we get O(k(n^3+mn^2))
I think there are
How do you do ??
this is regarding the Q
Can you guys tell me what will the answers of following operations:
1. -22 % 3 = ?
2. 22 % -3 = ? (This one I know actually, it will be 2, I know the
calculation but do not know the explanation)
3. -22 % -3 = ?
Answers::
1. -1
explanation :
3)-22 (
