perlquestion
AlexTape
<code>> #!/usr/bin/perl -w
> use strict;
>
> my$f= $[;my
> $ch=0;sub l{length}
> sub r{join"", reverse split
> ("",$_[$[])}sub ss{substr($_[0]
> ,$_[1],$_[2])}sub be{$_=$_[0];p
> (ss($_,$f,1));$f+=l()/2;$f%=l
> ();$f++if$ch%2;$ch++}my$q=r
> ("\ntfgpfdfal,thg?bngbj".
> "naxfcixz");$_=$q; $q=~
> tr/f[a-z]/ [l-za-k]
> /;my@ever=1..&l
> ;my$mine=$q
> ;sub p{
> print
> @_;
> }
>
> be $mine for @ever
>
</code><br>prints:<br><br><code>Replacement list is longer than search list at heart.pl line 14.
kristen, will you marry me?</code><br>So anybody can decrypt that?! i´m absolutely stucked by understanding this :D<br>(think i found it here in the forum?! dont know atm)<br><br>kindly perlig<br><br>
<!-- Node text goes above. Div tags should contain sig only -->
<div class="pmsig"><div class="pmsig-893562">
$perlig =~ s/pec/cep/g if 'errors expected';
</div></div>