Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number


by gods
on Aug 24, 1999 at 22:43 UTC ( #339=perlfunc: print w/replies, xml ) Need Help??


See the current Perl documentation for ucfirst.

Here is our local, out-dated (pre-5.6) version:

ucfirst - return a string with just the next letter in upper case

ucfirst EXPR


Returns the value of EXPR with the first character uppercased. This is the internal function implementing the \u escape in double-quoted strings. Respects current LC_CTYPE locale if use locale in force. See the perllocale manpage.

If EXPR is omitted, uses $_.

Log In?

What's my password?
Create A New User
[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?
[Eily]: the demonstration itself is fairly easy. The number of paths on a node is the sum of the numbers of paths to the two nodes above (or one node above on the edges of the triangle)
[Eily]: since the value of a node is also the sum from the two nodes above, you just have to demonstrate that the equality is true at the top of the triangle
[Discipulus]: yes Eily, thanks oiskuu but i dont get it.. ;=( maybe I'll ask a SOPW

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

    Results (239 votes). Check out past polls.