Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

Re: Is there a way more easy?

by Ratazong (Monsignor)
on Jun 20, 2012 at 14:11 UTC ( #977359=note: print w/replies, xml ) Need Help??

in reply to Is there a way more easy?

Algorithm::Combinatorics might help you ... the reference-section of the documentation gives you some background-reading. You may also check the other CPAN-modules containing the name combinatorics.

HTH, Rata

Replies are listed 'Best First'.
Re^2: Is there a way more easy?
by spadacciniweb (Deacon) on Jun 20, 2012 at 14:35 UTC

    I've solved using this code:

    #!/usr/bin/perl use strict; use warnings; use Algorithm::Combinatorics qw(variations_with_repetition); my @data = ('', 'a'..'z', 'A'..'Z','_'); my $iter = variations_with_repetition(\@data, 6); while (my $p = $iter->next) { my $plain = join '', values $p; print $plain,'.'; }
    Thank you!

    (($_="Mzz ojjdloobnf jt uvy5502383")=~y~b-zg2-5c96-81~a-z0-9~s)=~s~~~s; print

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://977359]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (4)
As of 2018-02-18 22:39 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (257 votes). Check out past polls.