Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: Parens permutations

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


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 03, 2003 at 01: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
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others meditating upon the Monastery: (4)
As of 2024-04-25 22:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found