@ps: ..:-)
On 5/22/11, Piyush Sinha wrote:
> @MONSIEUR..
> someone once said"THE SECRET OF SUCCESS IS TO NEVER REVEAL YOUR
> SOURCES..." ;)...:P..:P
>
> On 5/22/11, MONSIEUR wrote:
>> @piyush: excellent buddybtw what was the initial
>> spark...???.:-)
>>
>> On May 21, 1:0
Dude, its spoj pbm and see eular diagram
On 3/20/11, ganesha wrote:
> Given a number n, write a program to output its various compositions
> where order is not important.
>
> For eg, for 5, it will be
>
> 1 + 4
> 1 + 1 + 3
> 1 + 1 + 1 + 2
> 1 + 1 + 1 + 1 + 1
> 1 + 2 + 2 and so on
>
>
> Order is
@jalaj: u are more or less rightactually u check first that
whether the given seq first increases or dec then accordingly call
functionhere u have assumed that seq first increases n then
decreases so first u better check either increases or decreases.bt
overall good buddy..!!!
On 2
algorithm I guess that
will convert 24 bits into a unique 16 bit identifier. I'm not looking
for absolutely zero collision either. I'm not sure how good some of
the CRC style algorithms would work but if someone can convince me
that they will do the job then so be it.
Tha
