okay. thanks... so even theoretically there does not exist a way of
drilling a square hole??
On Oct 27, 7:09 pm, Geoffrey Summerhayes sumr...@gmail.com wrote:
Google - Watts Brothers square hole drills.
Not completely square leaves slightly rounded corners.
On Oct 27, 8:05 am, eSKay
now I get it, thanks a lot!
On Oct 27, 7:03 pm, Geoffrey Summerhayes sumr...@gmail.com wrote:
On Oct 26, 12:56 pm, eSKay catchyouraak...@gmail.com wrote:
This is one of the old puzzles, but I couldn't reason out how ppl get
to the answer they say.
An ant has to crawl from one corner
Can we drill a square hole by using a Reuleaux triangle, atleast
theoretically?
--~--~-~--~~~---~--~~
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
This is one of the old puzzles, but I couldn't reason out how ppl get
to the answer they say.
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?
I think the
People, try this one:
You and your opponent shall play a game with three dice: First, your
opponent chooses one of the three dice. Next, you choose one of the
remaining two dice. The player who throws the higher number with their
chosen dice wins. Now, each dice has three distinct numbers between
Lets call each possible configuration(removing the symmetrical
duplicates) a state.
How many such states of a Rubik's cube are possible?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
I know this problem doesn't sound new, but it is new to me and I
thought I could get some of your insight into solving this.
There are some ~1000 points on a plane. We need to find the minimum
radius circle that can hold all these points.
a) What I thought is that, first of all we need to
:25 pm, Geoffrey Summerhayes sumr...@gmail.com wrote:
On Oct 2, 7:20 am, eSKay catchyouraak...@gmail.com wrote:
What exactly do you prove here?
The first player always has a winning move.
You just make some statements, which should be proved. shouldn't it?
Or am I missing something
for each of these
applications .. however the basic concept remains the same,
I have attached a paper published by google on big table - u might find
that interesting !! :)
If u liked bigtable, u might as well read abt hadoop
Cheers!
On Fri, Oct 2, 2009 at 7:43 AM, eSKay catchyouraak
This problem was a sub-part of one of the Google Codejam problems this
year.
We have three circles, with radii and centers and we need to find the
center and radius of the circle that has the minimum radius and
encloses all these three circles.
The first step can be to subtract the radius of
okay thanks
On Sep 20, 2:59 am, Gene gene.ress...@gmail.com wrote:
On Sep 18, 5:45 pm, eSKay catchyouraak...@gmail.com wrote:
okay now I get it.
but then
int i;
do
{
i = 5 * (rand5() - 1) + rand5(); // i is now
What exactly do you prove here?
You just make some statements, which should be proved. shouldn't it?
Or am I missing something??
On Oct 2, 7:08 am, saltycookie saltycoo...@gmail.com wrote:
Here is a proof. Unfortunately, the proof is not constructive.The
secret of winning is 1, which is a
for example Google Maps, the amount of data is HUGE, and then you need
to be able to plot the path from one place to other, search
efficiently in the nearby area, zoom in, zoom out, show hundreds of
views etc.
I don't think the data structure used would be anything simple like -
nodes are cities
. [?]
On Sat, Sep 19, 2009 at 11:50 PM, eSKay catchyouraak...@gmail.com wrote:
for example: if I draw 2000, what I get is
1000+500+100+100+100+100+100.
What algorithm can be used to decide how to break up the entered
amount?
--
Shishir Mittal
Ph: +91 9936 180 121
329.gif
@Channa
thanks for explaining for the benefit of everybody.
On Sep 22, 4:50 pm, Channa Bankapur channabanka...@gmail.com wrote:
@eSKay, @Ankur, et al.,
Please be aware that there are non-Indians too in the group.
Hi All,
Let me try and define the problem precisely (as far as I can
I disagee. Please don't force your personal opinions on everybody like
this.
Thanks.
On Sep 20, 4:39 pm, ankur aggarwal ankur.mast@gmail.com wrote:
i think there is no use of discussing this ques..
On Sun, Sep 20, 2009 at 2:25 PM, eSKay catchyouraak...@gmail.com wrote:
yes
:
Is it different from classic Coin Denomination problem?
_dufus
On Sep 19, 11:20 pm, eSKay catchyouraak...@gmail.com wrote:
for example: if I draw 2000, what I get is
1000+500+100+100+100+100+100.
What algorithm can be used to decide how to break up the entered
amount
cool!
On Sep 5, 11:09 am, Dufus rahul.dev.si...@gmail.com wrote:
Tryhttp://en.wikipedia.org/wiki/Fourier_division
_dufus
On Sep 4, 10:36 pm, ankur aggarwal ankur.mast@gmail.com wrote:
Write an algorithm two divide two extremely large numbers, which cannot be
stored in an int, long
cool!
On Sep 10, 12:20 pm, Shishir Mittal 1987.shis...@gmail.com wrote:
On Tue, Sep 8, 2009 at 2:09 AM, ayush chauhan
therajput.ay...@gmail.comwrote:
Cud u plz explain the logic behind this?
On Mon, Sep 7, 2009 at 9:44 PM, Gokul spgo...@gmail.com wrote:
you can try this..
, etc. (Think of rolling two ordinary dice.)
Dave
On Sep 18, 6:19 am, eSKay catchyouraak...@gmail.com wrote:
one of the solutions given
athttp://stackoverflow.com/questions/137783/given-a-function-which-prod...
is:
int i;
do
for example: if I draw 2000, what I get is
1000+500+100+100+100+100+100.
What algorithm can be used to decide how to break up the entered
amount?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
one of the solutions given at
http://stackoverflow.com/questions/137783/given-a-function-which-produces-a-random-integer-in-the-range-1-to-5-write-a-fun
is:
int i;
do
{
i = 5 * (rand5() - 1) + rand5(); // i is now uniformly random
22 matches
Mail list logo
