Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

(lang: nl) Objecten voor beginners

by Juerd (Abbot)
on Dec 17, 2001 at 04:11 UTC ( #132425=perltutorial: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download

  1. or download this
     package Foo;
  2. or download this
     sub new {
         my $package = shift;
         bless $object, $package; # De magie
         return $object;
  3. or download this
     my $object = Foo->new;
     # of
     my $object = new Foo;
  4. or download this
     package Schaap;
     $dolly->blaat('Hallo');         # Schaap::blaat($dolly, 'Hallo')
     blaat $dolly('Ook dit werkt');  # Schaap::blaat($dolly,
                                     # 'Ook dit werkt');
  5. or download this
     sub kleur {
         my ($self, $kleur) = @_;
     print "De kleur is ", $obj->kleur(), ".\n"; # De kleur is blauw.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: perltutorial [id://132425]
[Discipulus]: oiskuu from the top aka 0-0 coords
[LanX]: edge or node?
[oiskuu]: from each height difference, there's a fixed number of "moves right" - "moves left". So it's a number of combinations.
[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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (10)
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.