@Anders: First cache should be 2,000 bananas at 200 km. Then you can
get 534 bananas to the destination as I explained in
http://groups.google.com/group/algogeeks/msg/6ff5e9ca52f4b5d6.
Dave
On May 21, 10:58 am, Anders Ma xuejiao...@gmail.com wrote:
1) go to 1000/3 with 1000 babanas, reserves
@Bhavesh: 533-1/3.
Dave
On May 20, 10:47 am, Bhavesh agrawal agr.bhav...@gmail.com wrote:
1 elephant can take 1000 banana at a time and eat 1 banana after each 1km
travel.
total bananas are 3000 and distance have to travel from A to B is 1000km.
So how many max bananas he can take from A to
533
On Sat, May 21, 2011 at 2:13 AM, Dave dave_and_da...@juno.com wrote:
@Bhavesh: 533-1/3.
Dave
On May 20, 10:47 am, Bhavesh agrawal agr.bhav...@gmail.com wrote:
1 elephant can take 1000 banana at a time and eat 1 banana after each 1km
travel.
total bananas are 3000 and distance have
Upon reading the problem more carefully, the answer is 534 bananas,
not 533-1/3.
Dave
On May 20, 3:43 pm, Dave dave_and_da...@juno.com wrote:
@Bhavesh: 533-1/3.
Dave
On May 20, 10:47 am, Bhavesh agrawal agr.bhav...@gmail.com wrote:
1 elephant can take 1000 banana at a time and eat 1
with 534 , the elephant can travel only 534 Km! I am right?
Wladimir Araujo Tavares
*Federal University of Ceará
*
On Fri, May 20, 2011 at 8:36 PM, Dave dave_and_da...@juno.com wrote:
Upon reading the problem more carefully, the answer is 534 bananas,
not 533-1/3.
Dave
On May 20, 3:43
@Wladimir: According to the problem statement, the elephant starts out
with 3,000 bananas. I am saying that the elephant can deliver 534
bananas to the destination 1,000 km away.
Dave
On May 20, 7:22 pm, Wladimir Tavares wladimir...@gmail.com wrote:
with 534 , the elephant can travel only 534
@Dave: The problem statement says, the elephant can take 1000 at a time.
If he take max 1000, and eat 1 banana in each 1 km travel, he will be having
0 after 1000 Km.
Anuj Agarwal
Engineering is the art of making what you want from things you can get.
On Sat, May 21, 2011 at 9:57 AM, Dave
Yeah. Sorry, it is my bad missed to observe N = 5623.
Regards,
Venki.
On Feb 25, 11:22 pm, Dave dave_and_da...@juno.com wrote:
@Venki. Hmmm. Let me see. The problem specified that there were 5623
participants. That makes n = 5623. You say that n-1 games are needed,
and compute that as 5621.
Yeah, Dave. It is simple, but small correction, we need 5621 games to
figure out the winner.
In general, if we are having n participants we need n - 1 games to
determine the final winner. We can conclude the fact, by drawing the
tournament tree for small numbers and count for the games to be held
@Venki. Hmmm. Let me see. The problem specified that there were 5623
participants. That makes n = 5623. You say that n-1 games are needed,
and compute that as 5621. So you are saying that 5623 - 1 = 5621. Is
that some kind of new math?
Dave
On Feb 25, 4:01 am, Venki venkatcollect...@gmail.com
Simpler. Every game eliminates one participant. Since 5,622
participants must be eliminated to have one winner, it takes 5,622
games.
Dave
On Feb 24, 5:43 pm, bittu shashank7andr...@gmail.com wrote:
If you had 5,623 participants in a tournament, how many games would
need to be played to
On Feb 16, 12:53 pm, bittu shashank7andr...@gmail.com wrote:
Two robots are placed at different points on a straight line of
infinite length. When they are first placed down, they each spray out
some oil to mark their starting points.
You must program each robot to ensure that the robots
well its game of Number Theory
There are 3 possibilities in any number set - prime numbers, non-prime
numbers (that are not squares) squares.
In this puzzle the original state of a door will be reversed if it is
acted upon an odd number of times - otherwise the original state the
final state
@Bittu: Since you didn't say what the weights are, I presume that I
can choose the weights. So I simply choose 125 1 kg weights. Then I
can weigh the required sugar packets with 125 weight movements: simply
add a 1 kg weight for each subsequent sugar packet.
Further presuming that this is not the
up vote to
9 + 1 + 1/9
On Thu, Jan 27, 2011 at 6:06 PM, sunny agrawal sunny816.i...@gmail.comwrote:
another one
9*(1+ 1/9)
On Thu, Jan 27, 2011 at 5:40 PM, nhkrishna2...@yahoo.com
nhkrishna2...@gmail.com wrote:
9+1+1/9
On Jan 27, 4:43 pm, ankit agarwal ankitgeniu...@gmail.com wrote:
9+1+1/9
On Jan 27, 4:43 pm, ankit agarwal ankitgeniu...@gmail.com wrote:
(9*9-1)/(9-1)
On Thu, Jan 27, 2011 at 4:55 PM, nishaanth nishaant...@gmail.com wrote:
(91-1)/9
On Wed, Jan 26, 2011 at 11:07 PM, Apoorve Mohan
apoorvemo...@gmail.comwrote:
9 + 1 - ( 1 / 9 )
On Wed, Jan
another one
9*(1+ 1/9)
On Thu, Jan 27, 2011 at 5:40 PM, nhkrishna2...@yahoo.com
nhkrishna2...@gmail.com wrote:
9+1+1/9
On Jan 27, 4:43 pm, ankit agarwal ankitgeniu...@gmail.com wrote:
(9*9-1)/(9-1)
On Thu, Jan 27, 2011 at 4:55 PM, nishaanth nishaant...@gmail.com
wrote:
9/.9 + 1 - 1
On Jan 26, 8:12 am, may.I.answer may.i.answ...@gmail.com wrote:
You have four numbers 1 , 1 , 9 ,9 .
Now using these four and operator + , - , * ,/ and parentheses(if
required) your have to get 10.
--
You received this message because you are subscribed to the Google Groups
@neha yeah you can use them as per your choice
On Wed, Jan 26, 2011 at 9:31 PM, Dave dave_and_da...@juno.com wrote:
9/.9 + 1 - 1
On Jan 26, 8:12 am, may.I.answer may.i.answ...@gmail.com wrote:
You have four numbers 1 , 1 , 9 ,9 .
Now using these four and operator + , - , * ,/ and
Generalization algorithm for the 8 - queens classical chess problem
On Jan 4, 5:43 am, bittu shashank7andr...@gmail.com wrote:
There is a lock which is an N by N grid of switches. Each switch can
be in one of two states (on/off). The lock is unlocked if all the
switches are on. The lock is
ankur is right
this problem is similar to the problem of converting a matrix to zero matrix
On Tue, Jan 4, 2011 at 8:36 PM, Ankur Khurana ankur.kkhur...@gmail.comwrote:
how are they similar ?
On Tue, Jan 4, 2011 at 8:31 PM, jennmeedo jennme...@gmail.com wrote:
Generalization algorithm for
2nd puzzle
An ant has to crawl from one corner of a room to the diametrically
opposite corner as quickly as possible. If the dimensions of the room
are 3 x 4 x 5, what distance does the ant cover?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
The ant needs to cover: 9.403 units. It will need to pass the diagonal of
the side (4 by 5) and go up or down the side 3 units.
3+ sqrt(16+25)
On Fri, Dec 31, 2010 at 4:16 PM, bittu shashank7andr...@gmail.com wrote:
2nd puzzle
An ant has to crawl from one corner of a room to the
@vanadana
why are you calculating 3 complete... use minimized distance..
min.{ sqrt(4^2+x^2)+sqrt(3^2+(5-x)^2)};
so final answer is 8.6023144 units..
On Dec 31, 4:30 pm, Vandana Bachani vandana@gmail.com wrote:
The ant needs to cover: 9.403 units. It will need to pass the diagonal of
the
@Anuj and Bittu: It is not necessary to know the bias. You can
simulate the flip of an unbiased coin with multiple flips of a biased
coin: Flip it twice. If the result is HT, consider it a Head. If the
result is TH, consider it a Tail. If the result is HH or TT, repeat
the process. It terminates
Let's first simplify the problem and assume it's a cube of sides equal
to 3.
Just unflap one of the two vertical faces of the cube, that touch the
diametrically opposite point, so that this face is in the same plane
as the top face.
Now the start and end point are in the same plane. They are
No need to enumerate all possible states.
In the final state (2,8,5), each jug is neither full nor empty, while
every valid operation has to fill or empty one jug.
So it is not possible to get this state from any other state by one
valid operation. (As others said, the state before the final
Assuming that the only moves you can make are to pour the contents of
one jug into another until either the source is empty or the
destination is full, the following are the only positions possible:
0: initial position (15,0,0)
1: starting from 0, pour 10
@ dheerraj...u cant measure 8 litre...u hve no additional instrument
@mohit...what do u mean by n th stageplzz elaborate
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To
@Sharad
let's say that it will take n steps to reach from [15,0,0] to [2,8,5] then
after nth state will be 2,8,5
and (n-1)th state will be say [x,y,z] from which one transfer will lead to
o/p [2,8,5]
hope it's clear
Mohit Ranjan
On Tue, Jun 8, 2010 at 6:54 AM, sharad kumar
Take a Nut, try putting it to all bolts (this is Comparing Nut with
Bolt). If Nut goes not go and fit into bolt, keep the bolt on left, if
Nut fits loose, keep the bolt on right and keep the bolt and nut which
match, at centre. This is pivot of quicksort. All bolts to left of
this central Nut+bolt
hw ???
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to
Why Linda cannot be the Winner? Amy could be the second and Cindy is the
third one.
Thanks
Liu Yan
On Wed, Jul 1, 2009 at 12:52 AM, Ankit Gupta talk2anki...@gmail.com wrote:
Cindy is Musician
Thanks Regards:
Ankit Gupta
B.Tech Final Year IT
NIT,Allahabad
Mob-+91-9369309343
On Wed,
Sorry, the third one should be3. L A C
Linda is a musician, Amy is a math-major , Cindy has black hair
On Thu, Jul 2, 2009 at 10:33 AM, anilkumarmyla anilkumarm...@gmail.comwrote:
Cindy(C) Linda(L) Amy(A)
The three possible solutions are : 1st to 3rd position in order
1. C L A
Cindy is a
Cindy(C) Linda(L) Amy(A)
The three possible solutions are : 1st to 3rd position in order
1. C L A
Cindy is a musician, Linda is a math-major and has red hair, Amy has black
hair
2. L C A
Linda is a musician and has red hair, Cindy is a math-major, Amy has black
hair
3. L A C
Linda is a
Yes Linda or Cindy either can be a winner..
Thanks Regards:
Ankit Gupta
B.Tech Final Year IT
NIT,Allahabad
Mob-+91-9369309343
On Thu, Jul 2, 2009 at 5:50 AM, liu yan ryu...@gmail.com wrote:
Why Linda cannot be the Winner? Amy could be the second and Cindy is the
third one.
Thanks
Liu Yan
since chance of linda win high only linda correct??
On Thu, Jul 2, 2009 at 2:19 PM, anilkumarmyla anilkumarm...@gmail.comwrote:
Listing all the 6 possibilities, we can rule out 3 of them
1. C L A
2. L C A
3. L A C
4. C A L --- violates Linda having red hair, given the third one had black
Cindy is Musician
Thanks Regards:
Ankit Gupta
B.Tech Final Year IT
NIT,Allahabad
Mob-+91-9369309343
On Wed, Jul 1, 2009 at 1:14 PM, AKS abhijeet.k.s...@gmail.com wrote:
Three beauty pageant finalists-Cindy, Amy and Linda-The winner was
musician. The one who was not last or first was a math
cindy is the winner and the musician.
Rishab Gupta
B.Tech Final Year IT
USIT,GGSIPU,Delhi
Mob-+91-9711446473
On Wed, Jul 1, 2009 at 12:52 AM, Ankit Gupta talk2anki...@gmail.com wrote:
Cindy is Musician
Thanks Regards:
Ankit Gupta
B.Tech Final Year IT
NIT,Allahabad
Mob-+91-9369309343
Explain please.
On Wed, Jul 1, 2009 at 9:57 PM, rishab gupta rishab.cr...@gmail.com wrote:
cindy is the winner and the musician.
Rishab Gupta
B.Tech Final Year IT
USIT,GGSIPU,Delhi
Mob-+91-9711446473
On Wed, Jul 1, 2009 at 12:52 AM, Ankit Gupta talk2anki...@gmail.comwrote:
Cindy
Do you know if the faulty marble is lighter or heavier?
On 2/2/07, Atamurad Hezretkuliyev [EMAIL PROTECTED] wrote:
Hi,
Can somebody help me with this puzzle? I tried to solve it but couldn't.
Puzzle 1
Weighing marbles
Given are 12 marbles. One of these marbles is slightly heavier or
We don't know if the marble is heavier or lighter ... which makes it
interesting :)
Here's a very clever solution:
http://mathforum.org/kb/message.jspa?messageID=1085028tstart=0
On 2/2/07, aditi saha [EMAIL PROTECTED] wrote:
Do you know if the faulty marble is lighter or heavier?
On 2/2/07,
Split the marbles into sets of 4 each
Compare the first and second sets
If both the sets are equal (the problem is in third set)
{
choose 2 of the marbles in the third set
compare with 2 marbles from the first set(which we know are good)
if comparision is equal
{
compare one of
Venkatesh Dayalan 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.
Suppose that the product is 30.
M1 doesn't know the value of S and M2 doesn't know the value of P.
Now both the mathematicians enter
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
int steps_combi(int steps)
{
if(steps==1)
return 1;
if(steps==2)
return 2;
// can take single step or double step
return (steps_combi(steps-1) + steps_combi(steps-2));
}
You have to consider permutations as well and not just combinations.This will increase the total number of ways.~VishalOn 1/23/06, Ankur Khetrapal
[EMAIL PROTECTED] wrote:
thisis done using integral solution method..
letx - no. of single steps
lety - no of double steps
x + 2y = 22
x = 22 - 2y
Hi,
It can be derived as follows...
Let f(n) denote the no. of ways in which 'n' steps can be climbed...
So, for climbing 'n' steps, the possible combinations are,
1. Climb one step initially.. so, n-1 steps left.. they can be climbed
in f(n-1) ways, OR
2. Climb 2 steps initally... so, n-2
101 - 148 of 148 matches
Mail list logo
