Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Pittsburgh Perl Workshop 2007

by ehdonhon (Curate)
on Jun 25, 2007 at 17:58 UTC ( #623217=perlnews: print w/replies, xml ) Need Help??

The Pittsburgh Perl Workshop 2007 web site is now live. Call for papers is now open. (See the site for the full announce text)

Major differences from last year's conference include:

  • The workshop is now a two-day event.
  • Special, new course for programmers with little or no Perl experience.
  • Improved scheduling.
  • The web site is now powered by ACT

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: perlnews [id://623217]
[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
[oiskuu]: yergh, <code> tags... [$top_height .. $node_height]
[Eily]: Discipulus by demonstrate I suppose you mean simulate with perl?

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

    Results (239 votes). Check out past polls.