Re: [algogeeks] help required...

2010-09-23 Thread santhosh
if the possibilty of a person knowing other any1 based circular linked.. ie. 1/n.. then none becomes celebrity .. so wat to do in tat situation?? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@g

[algogeeks] Re:

2009-08-15 Thread santhosh venkat
number of eggs On Sat, Aug 15, 2009 at 8:51 PM, sharad kumar wrote: > > can u use a game tree > http://en.wikipedia.org/wiki/Game_tree > > On Sat, Aug 15, 2009 at 8:49 PM, santhosh venkat < > santhoshvenkat1...@gmail.com> wrote: > >> @ Sharad >> I think the

[algogeeks] Re:

2009-08-15 Thread santhosh venkat
@ Sharad I think the replier's logic and explanation for the same can be found here . http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=algorithmGames Besides i think dp can also be applied here .but it needs lot of memory Santhosh . On Sat, Aug 15, 2009 at 8:42 PM, shara

[algogeeks] Re: Check divisibility by 3

2009-08-14 Thread santhosh venkat
ggarwal < >>>> yogesh.aggarwa...@gmail.com> wrote: >>>> >>>>> (CORRECTED ALGO.) >>>>> We can do like dis... >>>>> - add all d digits of the no. >>>>> - if the result is MORE than 10, add all the digits of the re

[algogeeks] Re: Check divisibility by 3

2009-08-14 Thread santhosh venkat
given a number n u can get the quotient when it is divided by 4 using right shift 2 times like n >> 2 this ll give u quotient(q) u can get the remainder by subtracting 4 * q from n which will give the remainder when divided by 4 by doing this u ll express n as n = 4q + r = 3q + (q+r) in this al

[algogeeks] Re: Finding repeated element in most efficient way

2009-08-09 Thread santhosh venkat
http://en.wikipedia.org/wiki/Pigeonhole_sortI think it was the repliers intention. But i think it is not the most optimal way of solving the question as the amount of memory it needs in the worst case is higher On Sun, Aug 9, 2009 at 1:47 PM, richa gup

[algogeeks] Re: Pigeon Hole Principle

2007-03-25 Thread Santhosh Suresh
ed (This is not > > > continuous. But nothing prevents you from assuming a non-continuous 100 > > > red > > > sections as a logical half) > > > Half2 = All the sections in the outer disc painted white > > > > > > Now with this interpretation, read his

[algogeeks] Re: Pigeon Hole Principle

2007-03-24 Thread Santhosh Suresh
you can assume that the 100 reds and > 100 whites are contiguous blocks.It just says that the outer disk has > a sum of the 100 reds and 100 whites and does not say that they are > contiguous. > > > > -- Santhosh S ME05B045 Dept. of Mechanica

[algogeeks] Pigeon Hole Principle

2007-03-18 Thread Santhosh Suresh
This problem has been troubling me from quite a long time. The circumference of two concentric disks is divided into 200 sections each. For the outer disk, 100 of the sections are painted red and 100 of the sections are painted white. For the inner disk the sections are painted red or white in an

[algogeeks] Fwd: [algogeeks] Re: the sum of two unsigned integers

2007-01-24 Thread Santhosh Suresh
I contradict myself? Very well then I contradict myself, I am large, I contain multitudes." - Walt Whitman -- Santhosh S ME05B045 Dept. of Mechanical Engineering, IIT Madras, Chennai-600036 --~--~-~--~~~---~--~~ You received this message because you are subscri