Can you tell me the name of the equivalent SPOJ problem ?

On Mar 21, 6:23 pm, Azazle simon <[email protected]> wrote:
> Dude, its spoj pbm and see eular diagram
>
> On 3/20/11, ganesha <[email protected]> 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 not important implies 1 + 4 is same as 4 + 1.
>
> > Modify the program such that the order is important.
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to [email protected].
> > To unsubscribe from this group, send email to
> > [email protected].
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> Sent from my mobile device- Hide quoted text -
>
> - Show quoted text -

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Reply via email to