BFS
On Thu, Jul 29, 2010 at 11:56 PM, irfan naseef wrote:
>
>
> On Thu, Jul 29, 2010 at 11:35 PM, ashish agarwal <
> ashish.cooldude...@gmail.com> wrote:
>
>> please explain q ..i didnt understand
>>
>>
>> On Thu, Jul 29, 2010 at 11:01 AM, irfan wrote:
>>
>>> I attended Amazon placement test tod
I meant the final single digit number that one gets...for eg
if the sum is 123 then the answer would be 1+2+3 = 6.
On Sun, Oct 11, 2009 at 6:59 PM, Prunthaban Kanthakumar
wrote:
>
>
> On Sun, Oct 11, 2009 at 6:40 PM, Gautham Muthuravichandran
> wrote:
>>
>> 9.. All th
ote:
> @gautam
> i dont understand
>
> On Sun, Oct 11, 2009 at 6:59 PM, Prunthaban Kanthakumar
> wrote:
>>
>>
>> On Sun, Oct 11, 2009 at 6:40 PM, Gautham Muthuravichandran
>> wrote:
>>>
>>> 9.. All the factorials above 5! is
9.. All the factorials above 5! is divisible by 9.
-Gautham
On Sun, Oct 11, 2009 at 11:54 AM, Debanjan wrote:
>
>
>
> On Oct 11, 10:29 am, Anil C R wrote:
>> Project Euler!!
>
> I remember I cheated on this problem :P At first I used my SPOJ FCTRL2
> solution to get the factorial of 100 then I
Mike,
The series P(n) = {1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786,
208012,
742900, 2674440} is Catalan numbers. Can you please throw more light on how
you arrrived at this solution.
TIA
Gautham
On 7/19/07, Mike <[EMAIL PROTECTED]> wrote:
>
>
> Hi Rupesh,
>
> Despite the fact that the
Guess those are names of Iranian months..
On 7/19/07, Yingjie Xu <[EMAIL PROTECTED]> wrote:
>
> What's Mordad and Shahrivar? Is it an English word?
>
> On 7/19/07, Mohammad <[EMAIL PROTECTED]> wrote:
> >
> > قابل توجه علاقمندان به مسابقات برنامه نویسی،
> > چهارمين دوره از مسابقات برنامه نویسی IAUM
if u know the number of elements (n)
height = ln n should do the trick
On 4/17/07, Virag Dhulia <[EMAIL PROTECTED]> wrote:
>
> HI Experts,
>
> I want to calculate the height of a binary tree recursively, any help will
> be appreciated
>
> --
> A man with dreams is never alone
> >
>
--~--~---
