Beefy Boxes and Bandwidth Generously Provided by pair Networks RobOMonk
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Parens permutations

by dws (Chancellor)
on Aug 02, 2003 at 19:51 UTC ( [id://280364]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to Parens permutations

If   1 ((2 3)) is valid, then what about   1 (((2 3))) ? If that's valid, then you have a countably infinite number of possible permutations. I kinda doubt the problem is phrased to allow that.


Update: D'oh. So that's what p= means.

Replies are listed 'Best First'.
Re: Re: Parens permutations
by artist (Parson) on Aug 02, 2003 at 21:16 UTC
    Hi dws,
    The number of parens are given. So if p = 2 then 
    1 ((2 3)) => valid 
((1 2 3)) => valid 
1 (((2 3))) => invalid

    artist

[reply]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://280364]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    • hippo‥ epoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    • erzuuli‥ Anonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.