Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic

Re^2: Pearls (not really) of Perl programming

by ikegami (Pope)
on Nov 24, 2004 at 19:39 UTC ( #410231=note: print w/replies, xml ) Need Help??

in reply to Re: Pearls (not really) of Perl programming
in thread Pearls (not really) of Perl programming

Seems kutsu doesn't know about using a seperator other than / ;) Neither \Q\E nor quotemeta() are needed here.

s#%B%#<b>#g; s#/B/#</b>#g;

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://410231]
[oiskuu]: Yeah, modifry the recursive func combinations() to return not the number, but the paths themselves.
[Eily]: Discipulus I'd do that by starting from the bottom node I think. That way it can inherit the paths from the two nodes above (and so on, recursively)
[LanX]: oh I meant fixed amount
[LanX]: every path must have l left and r right edges and l and r are fixed and l+r is the height
[LanX]: simple recursive function which goes left and right till l or r are exhausted
LanX #solved
[oiskuu]: I must watch Police Academy again sometime.

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (7)
As of 2018-03-19 11:24 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.