7 races. well explained by Dave.
On Thu, Mar 31, 2011 at 11:00 AM, sourabh jakhar wrote:
> answer is 6 races
>
>
>
> On Mon, Mar 28, 2011 at 11:53 PM, Dave wrote:
>
>> 7 races.
>>
>> For the first five races, divide the horses into groups of five and
>> record the win, place, and show finishers
question : A programmer wants to test whether or not n given
conditions are all simultaneously true (e.g he may want to test
whether both x>0 and yhttp://groups.google.com/group/algogeeks?hl=en.
hey guys please help me to solve this
QUESTION : input a number C , an output all of the ways that a group
of ascending positive numbers can be summed to give C. for e.g if
C=6,the output should be
1+2+3
1+5
2+4
[solve using dynamic programming]
please tell me about this..
--
You received this
Hi , Use Hashing for That , for sum =12 & arr[]={2,4,3,6,5,8,7}; store
in to hashtable & for each index=0 in loop find sum-arr[index] so
fro sum =12 if we do index=1 a[1]=4 & sum-a[1]=8 so stop it we have
done..hope make d perfect code.
time Complxity o(n) space size of hashtable
Let me me if an
Consider the problem of neatly printing a paragraph on a printer. The
input text is a sequence of n words of lengths l1, l2, l3, ……,ln,
measured in characters. We want to print this paragraph neatly on a
number of lines that hold a maximum of M characters each. Our
criterion of “neatness” is as fol
Dear Colleagues:
Please share the announcement below with those who may be interested.
Thank you, Organizing Committee
CALL FOR PAPERS
===
Extended Paper Submission Deadline: April 10, 2011
Given a directed graph G, with V vertices and E edges. Each edge in E
is associated with a real number ‘r’,a reliabilty factor with r
between 0(exclusive) and 1(inclusive). You are also given a pair of
nodes u and v. Find the most reliable path in the given graph from u
to v.
Input will be the grap
Hi
Puzzle Digest Of The Week 28March-1st April
*http://dailybrainteaser.blogspot.com/2011/03/28march.html?lavesh=lavesh*
*
*
*http://dailybrainteaser.blogspot.com/2011/03/29march.html?lavesh=lavesh*
*
*
*http://dailybrainteaser.blogspot.com/2011/03/30march.html?lavesh=lavesh*
*
*
*http://dailybra
