1
2
$test = "Test";
print $test X 2;

1
2
3
$a="test"
$a.="done"
print $a

1
2
$test = "Test"
Stest X 2

1
2
$a="test"
$a.="done"

1
2
$test = "test"
print $test X 2

1
while (($_ = $*IN.get) != 42) { say $_ }

1
2
3
4
5
6
7
#include <stdio.h> 
 
int main(void) { 
  int x; 
  for(; scanf("%d",&x) > 0 && x != 42; printf("%d\n", x)); 
  return 0; 
} 

1
while (($_ = $*IN.get) != 42) { say $_ }

1
2f558ef3cc05e4dc17f54e844f3b6af7a527c2fbc3801283ae2ef01a2960c6fa

1
2
3
4
5
6
7
8
9
use strict;
use warnings;
 
my $magic = 600851475143;
 
sub largestprimef($);
sub max($$);
 
print largestprimef($magic);
 ...

1
while (($_ = $*IN.get) != 42) { say $_ }

1
2
3
4
5
6
7
8
9
#!/usr/bin/perl
@xlat = ( 0x64, 0x73, 0x66, 0x64, 0x3b, 0x6b, 0x66, 0x6f, 0x41,
          0x2c, 0x2e, 0x69, 0x79, 0x65, 0x77, 0x72, 0x6b, 0x6c,
          0x64, 0x4a, 0x4b, 0x44, 0x48, 0x53 , 0x55, 0x42 );
        $in = $ARGV[0];
        $ep = $in; $dp = "";
        ($s, $e) = ($in =~ /^(..)(.+)/o);
        for ($i = 0; $i < length($e); $i+=2) {
            $dp .= sprintf "%c",hex(substr($e,$i,2))^$xlat[$s++];
 ...

1
2
$a=ord("A");
print" $a";

1
2
3
4
5
6
7
8
#!/usr/bin/perl
 
use LWP;
use HTTP::Request::Common;
use HTML::TreeBuilder;
use strict;
 
@ARGV == 1 or die "Specify a single URL.\n";
 ...

1
$/{print $(NF-1)}

1
2
3
4
5
6
7
8
9
use Digest::MD5 qw (md5_hex);
use Data::Uniqid qw (suniqid uniqid luniqid );
 
my $id = &gen_token;
print "Id=$id\n";
 
sub gen_token {
# approx equiv to md5(uniqid(rand(), true));
return md5_hex(uniqid);

1
2
3
4
5
6
7
8
9
Итак, поехали:
#!/usr/bin/perl 
 
## Autors: Mike: mike@eggru.com, Forb: dmitry@dokuchaev.com 
## Modified by sikeirosa: sikeirosa@mail.ru 
 
use MIME::Base64; 
use IO::Socket; 
use POSIX; ### Подрубаем модули POSIX, Socket и Base64 
 ...

1
2
3
4
5
6
7
8
9
$x=<>;
while(<>)
{
$strnam=<>;
$strn=<>;
$strname=$strnam$strn;
if(eof())
{
break;
 ...

1
perl -e 'print "HELLO"'

1
perl -e 'print "HELLO"'

1
say "HELLO"

1
2
3
4
5
6
7
8
9
'#include <iostream> /*\r\n\r\n*/ using namespace std;'
'int main (){cout << "N 40° 19.008";return 0;} /*int*/'
z=rr(ee()): function gg(dd): msgbox dd:end function:k=2
q=chr(176):s=chr(32): h=chr(78):b=chr(87):p=chr(46):t=3
'public class DsplyCoord{public static void main //void
'(String[] args) {System.out.println("N 40° 19.008");}}
x=rr(ee()): function yy(n,i):yy=left(n,i): end function
function ee():ee=trim(inputbox(j)):end function 'k=r(g)
v=rr(ee()):function xx(n,i): xx=right(n,i):end function
 ...

1
2
3
4
5
6
sub cc{ $z=shift; chr $z }; $n=$ARGV[0]; $o=$ARGV[1]; $q=$ARGV[2];
@c=($q,$n+$q,5+$q,$q*$n,$n, 4*$q,$o-5,0/$o,$o,$o/$o); $b=cc 29*$n;
@c=reverse @c;$s=cc 4*4*$q;$p=cc 23*$q;$d=$c[0];$l=$c[8];$i=$c[5];
$f=$c[2]; $g=$c[3];$h=$c[4];$e=$c[1];$j=$c[6];$k=$c[7];$a=cc 13*6;
$m = $c[9]; $x="$a$s$g$f$s$d$e$p$h$d$f$s$b$s$f$k$l$s$d$h$p$l$m$l";
sub dd { $z=shift; print $z }; dd " \n$s$s$s$x$s$s$s\t\t\t\t \n ";

1
2
3
4
5
6
sub cc{ $z=shift; chr $z }; $n=$ARGV[0]; $o=$ARGV[1]; $q=$ARGV[2];
@c=($q,$n+$q,5+$q,$q*$n,$n, 4*$q,$o-5,0/$o,$o,$o/$o); $b=cc 29*$n;
@c=reverse @c;$s=cc 4*4*$q;$p=cc 23*$q;$d=$c[0];$l=$c[8];$i=$c[5];
$f=$c[2]; $g=$c[3];$h=$c[4];$e=$c[1];$j=$c[6];$k=$c[7];$a=cc 13*6;
$m = $c[9]; $x="$a$s$g$f$s$d$e$p$h$d$f$s$b$s$f$k$l$s$d$h$p$l$m$l";
sub dd { $z=shift; print $z }; dd " \n$s$s$s$x$s$s$s\t\t\t\t \n ";

1
2
3
4
5
foo( {-1/*_} ) if!'*/%'; print "Hello, Perl!\n" if<<'-- */'
}). :- write('Hello, Prolog!'), nl, halt.
/* -} x) = x
main = putStrLn "Hello, Haskell!"
-- */

1
2
3
4
5
6
7
8
9
use v6;
 
sub find_first(@list, Matcher $matcher --> Int)
{
    my @fl = @list.grep($matcher);
    if @fl.elems >= 0
    {
        for @list.kv -> $i, $v
        {
 ...

1
2
3
4
5
6
7
8
9
use v6;
 
sub find_first(@list, Matcher $matcher --> Int)
{
    my @fl = @list.grep($matcher);
    if @fl.elems >= 0
    {
        for @list.kv -> $i, $v
        {
 ...

1
2
3
4
5
6
7
8
9
use v6;
 
sub find_first(@list, Matcher $matcher --> Int)
{
    @fl = @list.grep($matcher);
    if @fl.elems >= 0
    {
        for @list.kv -> $i, $v
        {
 ...

1
2
3
4
5
6
7
8
9
use v6;
 
sub find_first(@list, &matcher --> Int)
{
    @fl = @list.grep(&matcher);
    if @fl.elems >= 0
    {
        for @list.kv -> $i, $v
        {
 ...

1
2
3
4
5
6
7
8
9
use v6;
 
sub find_first(@list, Matcher $matcher --> Int)
{
    @fl = @list.grep($matcher);
    if @fl.elems >= 0
    {
        for @list.kv -> $i, $v
        {
 ...