Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling

Perl Monks User Search

( #6364=superdoc: print w/replies, xml ) Need Help??

This is where you can search for all the writeups contributed by any user. Just enter the user name and select the order for the search.

Author: Show nodes
Order by: starting at .
Node Type: Show Categorized Q&A (Why?)

Or try a Super Search

These nodes all have stuff by raaj (showing 1-7 out of ~7?):

Node ID Writeup Created
1027889 Global Variables and Pointer(Reference). 2013-04-10 05:31
1024511 which modules to be used..??? 2013-03-20 13:05
1008443 Re^2: how to get the font family 2012-12-12 05:04
1008293 how to get the font family 2012-12-11 12:35
980215 Re^2: Using perl script unzip the zip files 2012-07-06 06:07
980213 Using perl script unzip the zip files 2012-07-06 05:50
978871 Re^2: Regular Expression 2012-06-28 09:32
Log In?

What's my password?
Create A New User
[Discipulus]: I already know how much distinct paths exists but to demonstrate the property i want to have them all
[oiskuu]: ie C(n, k); where n is height difference, k is position in the line
[Discipulus]: infact there are 70 distinct path to reach the tale wich holds 70
[Discipulus]: what i want is to compute them
[oiskuu]: You want to draw the path? $iter = combinations( $TOP_HEIGHT .. $NODE_HEIGHT, $pos); then get the path from the iter, level change at depth x, for(..) $pos += $level_change; something like that

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

    Results (239 votes). Check out past polls.