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 bot
Thank you very much Shalin and Wade. Your ideas are really nice. I will
give them a try and give u feedback.
wade, the timelimit was 10 seconds, my solution took 10.025 seconds.
shalinmangar wrote:
> The low input size constraints (max size of the graph is 40*40) suggest
> that a brute force DFS
Posted: April 22, 2006
Job title: $300 flat for job in perl, cgi, Visual Basic/Asp.Net,
whatever online project
Company name: Sworde.com
Location:
United States, Colorado, Glenwood Springs
Pay rate: 300.00 flat for job
Travel: 0%
Length of employment: Until job done
Hours: Flexible
Onsite: no
Desc
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 the mathematicians enter separate room and do some calculation
and come back and they s
1 ) Radially sort the all the points of each chord (start and end both ).
2 ) Start with the first start point. Have c=1, tot=0, done[1..n]=0
3 ) Till all points are done:
a ) If its a start point then
tot = tot + c
c = c + 1
set done for this point 1
else if it i
one more version...
int a[]={1,-5,6,7,9,9,20,25,31,45};
int i=0,j=1,n=10;
int c;
while(i26)i++;
else
printf("%d %d ",a[i++],a[j]);
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
HiWho can design a an algorithm for determining whether a graph is k-connected or not?ps: see definition of k-connectivity from
http://en.wikipedia.org/wiki/Connectivity_%28graph_theory%29 if you want to know!-- -- Mohammaddo you C?!! double m[] = { 9580842103863.650391, 133470973390.236450, 270}
