my $p = $$; while ($A) { if (fork) { wait; $A = 1+($?>>8); $p-$$ ? exit $A : last; } } continue {--$A} exit 1 if $p ne $$;
$A += do { my @A = sub {($_[5]+1900,$_[4]+1)}->(localtime); (Add_Delta_Days(@A,Days_in_Month(@A),1))[-1] };
${(sort grep {$_ eq uc} grep {/\A[^\W_\d]\Z/} keys %{ do{__PACKAGE__ if __PACKAGE__ ne 'main'}.'::'})[0]}++;
${(sort grep {$_ eq uc} grep {/\A[^\W_\d]\Z/} keys %::)[0]}++;
use Inline C => 'int incr(int A) { ++A; return(A); }'; $A = incr($A);
@ARGV = ( '$c', map { ( $_, '$c.=pop;pop' ) } qw( + + A $ ) ); s//pop/eeeeeee;
tie $A, 'Tie::Increment', $A; $A; package Tie::Increment; sub TIESCALAR { bless {A=>$_[1]}, $_[0] } sub STORE { ($_[0])->{A} = $_[1] } sub FETCH { ++(shift)->{A} } 1;
use HTTP::Size; $A += HTTP::Size::get_size('http://www.landgren.net/perl/one-byte.txt');
use Acme::DonMartin; sittzle shpliple spla pwadak sklork wap splork flif foomp ting rumble sprizawitz clack
AUTOLOAD {ASSEMBLEUR} set ($B = $A); if ($B == 0) {goto ZERO}; EMPILE: push (@l, $B); subs ($B = $B - 1); if ($B!=0) {goto EMPILE} DEPILE: set ($x = pop(@l)); if (!$x) {goto CALCULE} add ($B = $B + $x); goto DEPILE; CALCULE: shft ($B = $B << 1); div ($A = $B / $A); goto TERMINE; ZERO: exor ($A = $A ^ 1); TERMINE:
(sub{s,^(.*),ドル1ドル+//,e for@_})->($A)
$A+=///////////////////////
$A += (\0-\0)/-24;
$A += !int\\\y////\\\\y////\\\\y////\\\\y///;
sub s { my $n = @_[0]; ($n)?($n + &s($n-1)):0 } $A = $A?(&s($A)<<1)/$A:1;
$B = 1; while (($A ^= $B) and !($A & $B)) { $B <<= 1; }
$A += !!(!!($!||!$!)x!!($!||!$!))x!!(!!($!||!$!)x!!($!||!$!))
*_ = *A; s/$/c!0123456789/; 1 while s/9c/c0/; s/^c/0c/; s/(.)c(\d*)!.*1円(.).*/3ドル2ドル/;
$A += (@A = split (/\./,`uname -r`))[1] >> $A[0];
our $A; $::(<A>)++;
$A += ( $A =~ m+$A$+m );
$A += $^R if "A BUG" =~ /^A(?{1}) (?:BUG(?{#32840}))?$/;
use Math::BaseCalc; $_ = Math::BaseCalc->new(digits=>[split//,'A+$'])->to_base(58) and eval;
$A-=$----$----$----$----$----!$-;
use Unicode::UCD 'charinfo'; my %ascii_by_name = map { charinfo($_)->{name} => $_ } (32..127); eval join '', map { chr($ascii_by_name{$_}) } ('DOLLAR SIGN', 'LATIN CAPITAL LETTER A', ('PLUS SIGN') x 2);
# <@p11+1g11 $A++
;$A++; # 20g1+20p@
echo +ACQ-A+-+- | perl -Mencoding=UTF-7
use LWP::Simple; eval qq!@{[get("http://paris.mongueurs.net/aplusplus.html")=~/title>([^<]*)/g]}!
${""}="Illegal seek::AUTOLOAD"; *${''} = sub { ${ (split //, "\U${ \__PACKAGE__ }")[1] }++ }; -qq|| => { q|| } -key { }
$A=~/(?{++$_})(?{$A=$^R})/;
$A=()=(0..$A)
eval pack('N', 608250667);
use IO::Socket; $A=aplusplus($A); sub aplusplus{ $Socket; $server="paris.mongueurs.net"; $port="80"; $a= &connect($Socket,$server,$port); $A= eval $a; } sub connect(){ my($socket,$host,$port)=@_; my $time; my $reply,$title; $socket = IO::Socket::INET->new(PeerAddr =>$host, PeerPort => $port, Proto => "tcp", Type => SOCK_STREAM) or die "Couldn't connect to $host : $port\n"; print $socket "GET /aplusplus.html\n"; $reply = <$socket>; while($reply){ $title=$reply if ($reply=~/<title>/i); $reply=<$socket>; } print $title; $title=~s#<.{5,6}>##g; $title=~s/(..)(..)/2ドル1ドル/; print $title; return $title; }
package A;sub TIESCALAR(){bless[$_[1]],$_[0]}sub FETCH(){$_[0]->[0]+1} package main; sub A {*a=*{$main::{$_[0]}};tie $a,$_[0],$a;} A('A');
${*{$main::{A}}{ref \$A}}++
$A+= (((((((((())))))))))=([10,9,8,7,6,5,4,3,2,1,FEU]);
$;=sub{ sub _{ $_[2]=substr($_[0],length($_[0])-1,1) + $_[1]; if (length($_[2])>1 or length($_[0])>1){ $_[2]= _(substr($_[0],0,length($_[0])-1),length($_[2])>1?substr($_[2],0,1):0) . substr($_[2],length($_[2])-1,1); } return ($_[2]); } $A=_($_[0],1); };($A)->$;;
$_=\1/\1;$A +=$_=~ s/(.*)(\.\d).*/(2ドル>0?1ドル+1:1ドル+$A)/e;
$A=0 unless defined $A; undef $/; $_=`lynx -source http://www.google.com/search?q=1%2B$A`; ($A) = />1 \+ $A = (\d*)</;
$A+=`pidof init`
$A = (sub { push @_, +@_ })->(($A) x ($A)) /2 + 1;
$A = (sub { push @_, -@_ })->(($A) x ($A));
urpmf --name -v -e '($a || ++$a) && 0'
$SIG{__WARN__} = sub {}; my @c = qw( $ B + = ; 1 ); my $p; my $B; do { $p=''; $B=41; for(1..(int(rand(5))+4)) { $p.=$c[rand @c]; } eval $p; } until ($B == 42); $p =~ s/B/A/g; eval $p; print "$p\n";
perl -le '${~$\&~$;&$^}++'
${~$/&~$;&$^}++
${chr($=+((ord($/))>>$$/$$))}++;
use XML::SAX::ParserFactory; XML::SAX::ParserFactory->parser(Handler=>bless\$A,A)->parse_string("<A/>"); sub A::end_element{${$_[0]}++}
use Lingua::Romana::Perligata; ao postincresce.
sub q() { 1 } ; $A += &q() + q()
$A -= $#{split(//, $A)};
perl -ce 'BEGIN { $A += $^C }'
$ A+= .5=> .5>= .5;$ A+=(1 =>.5)
eval join '', "044円", +::, A::, '+++$A::'
$ B = \ $ A ; $ A = $ $ B + 1
$A = 2**64-~$A;
$A = 2**32-~$A;
${'A.pm'}++; @INC =[ sub {$A++}] ; eval "require A";
use less; $A +=require strict if useless; use if
eval( "A++") or (${"A++"}) = $@ =~ m/"(.*)"/; eval '$' . ${"A++"};
$A += !((false or true) != 0)
$A += nil +1 if nil
%average::; print probably not my average $A++
my main $A++
use strict; my strict $A++
eval '$A'. (<<"" $A++ =~ m|(\W+)|)[0];
eval <<''; $A++
($d,$m,$f)=$A=~/^(.*?)([^9]?)(9*)$/; $m||=0; $f=~s/9/0/g; $m=~tr/0-8/1-9/; $A="$d$m$f";
$B=1;while(($A& $B)==$B){$B=$B*2+1;}$A^=$B;
#--------Free incrementation voucher-----------8<----Cut Here-----------# $ { ( '$' ) ^ 'A' ^ ( '=' ) & '$' | ( 'A' ) & '+' & ( '1' ) & ';' } ++ ; #---Découper suivant les pointilles--->8---Bon d'augmentation gratuit---#
for($A..$A+1){$A+=$_-$A};
import frelaté
Stéphane
30-Sep-2002*A::import = sub { shift; eval shift }; $INC{'A.pm'}++; eval q|use A '$A++'|
use Memoize; sub plusplus { $_[0]++ } memoize('plusplus'); plusplus( $A );
while ($plop!=1) {$plop=int(rand(42));} $A+=$plop;
use LWP::UserAgent; use HTTP::Request::Common; $A += 9*9*5-new LWP::UserAgent->request(GET 'http://www.oiseaux.net/neant')->code;
use Acme::Morse; .--.-..--..---.-.--..--.-..--..---.-.--. ..-..-..-.....-.--.-.-..--.-.-..--.---.. .-.-...
use Acme::Bleach;
sub PUSHED { bless {} } sub FILL { $x = readline $_[1]; defined $x ? $x + 1 : undef } open FH, "<:scalar:via(main)", \"$A"; $A = <FH>; close FH;
( $B = ( $C ='$A--++') ) =~ s/ ./ $a=$&; ($& =~ m(\w)) ? "($a)" : "(\\$a)" /gex; eval join '', ( $C =~ m/$B/)[0..1,4..5];
use 5.008; sub A::AUTOLOAD : lvalue { $::A }; &{A::A}()+=1;
use 5.008; use Hash::Util lock_keys; lock keys(%A); lock_keys(%A); eval '$A{$A}++' or eval '$' . ($@ =~ m/(.)/)[0] . '++';
eval "require 5.8" or $A+=($@ =~ m/\G.*?(\d+)/gc)[ ($] =~ m/(.)$/)[0] ];
s//$A++/e;
my $c = ''; while( ($b = chr(rand(255)) ) ne '$' ){}; $c .= $b; while( ($b = chr(rand(255)) ) ne 'A' ){}; $c .= $b; while( ($b = chr(rand(255)) ) ne '+' ){}; $c .= $b; while( ($b = chr(rand(255)) ) ne '+' ){}; $c .= $b; eval $c;
$A{$A}=\$A;${$A{$A}}++;
my %h=(); $A += !exists($h{$A});
$A += unshift @A, $A;
$A += $A !~ santana;
%h = qw(+ + $ A); unshift @l, each(%h); unshift @l, each(%h); eval join "", @l;
%h = ( '$'=>'+', 'A'=>'A', 'a'=>'$', '+'=>'+' ); eval join '', values(%h);
eval join '', grep { /[^ -#%-*,-\@B-~]/ } qw( 2 f $ a p p A 0 8 + - * = + 4 );
$A += ( map { tr/P/P/ } split(//,'Perl') )[0];
eval reverse '++A$';
eval join "", sort { ($a,$b)=($b,$a); 1 } split(//,'+$A+');
${(sort grep {/^\w/ && /\D/} keys %{(eval "(caller)[0]").'::'})[0]}++
use URI::Escape; eval uri_unescape('%24%41%2B%2B');
use URI::Escape; $c = '%2525252524%2525252541%252525252B%252525252B'; $c=uri_unescape($c) while($c ne uri_escape($c)); eval $c;
use URI::Escape; $c = '%2525252524%2525252541%252525252B%252525252B'; while($c) { if( ($c=uri_unescape($c)) eq uri_escape($c) ) { eval $c; last; } }
use POSIX; $A += int($POSIX::VERSION);
use Digest::MD5 qw(md5); $A -= ( split( //, md5('Et un de plus pour la variable $A !...') ) )[3]; $A += ( split( //, md5('Et un de plus pour la variable $A !...') ) )[3*3];
$A += @{ [ ( @{ caller(-1) }, "$A++" ) ] }
$A = eval join '+', map {$_ * 10**$e + 0**$e++} reverse $A=~ m/./g;
($A) = map {$A + $_} $A =~ /$A/;
++$A
$A = 1 + $A
$A = -$A; $A--; $A = -$A;
$A=-(-1-$A);
$A += " 1 jour mon prince viendra ... 1 jour on s'aimera ... "; # or $A += " 1 day my prince will come... one day... ";
use IO::Socket; use Sys::Hostname; if( ! fork() ) { $t = ( $s = new IO::Socket::INET(PeerAddr=>hostname(),LocalPort=>8888,Listen=>1) )->accept(); print $t ( <$t> +1)."\n"; close $t; close $s; exit(0); } else { sleep 1; $s = new IO::Socket::INET(PeerAddr=>hostname(),PeerPort=>8888); print $s "$A\n"; $A = int(<$s>); close $s; }
#Fichier Makefile.PL use ExtUtils::MakeMaker; WriteMakefile( NAME => 'PlusPlus', VERSION_FROM => 'PlusPlus.pm'); #Fichier PlusPlus.pm package PlusPlus; require DynaLoader; our @ISA = qw(DynaLoader); our $VERSION = '0.01'; bootstrap PlusPlus $VERSION; 1; __END__ /*Fichier PlusPlus.xs */ #include "EXTERN.h" #include "perl.h" #include "XSUB.h" MODULE = PlusPlus PACKAGE = PlusPlus int plusplus(input) int input CODE: RETVAL = input+1; OUTPUT: RETVAL #Fichier test.pl use PlusPlus; $A = PlusPlus::plusplus( $A );
$_="+36+29-22=",s/\G([=+-])(\d*)/$==1ドルeq'='?$-:eval"$-1ドル2ドル",chr($-=$=)/ge,eval
for ($adn = "ATCACAACATTGATTG";($i<length($adn)) or !($_=(pack "B32",$y)) or !eval();$y.=substr(unpack("B8",substr($adn,$i++,1)),5,2)) {}
use Perl6::Currying; sub add($a, $b) { $a + $b }; $incr = &add.prebind(a=>1); $A = $incr->($A)
use Attribute::Handlers; sub _ : ATTR(SCALAR) { ${$_[2]}++ } my $A : _ ; $A;
sub _ : lvalue { $A }; ++_();
use constant; my constant $A++
eval v36.65.43.43;
$A += ('(A)' =~ m|\(A\)|)[0] == ('(A)' =~ m|(A)|)[0];
$A += ('(A)' =~ m(\(A\)))[0] == ('(A)' =~ m((A)))[0];
use Math::Trig; $A-=cos(pi)
$_=sub {$| or ($|=1 and @_=(1,1,0,0,4,2,3,5)); return (substr("000001",5-shift(@_)))}; ${eval(pack "B24",eval(substr('.&$_'x8,1)))}++;
$_=sub{$~=$|++?$|:${chr($=+=5)}};${chr($=)}=&$_+&$_;
while (1) { pipe(LIT_P,ECRIT_F);pipe(LIT_F,ECRIT_P); local($fh)=select ECRIT_F; $|=1;select $fh; local($fh)=select ECRIT_P; $|=1;select $fh; if ($pid = fork){ close LIT_P;close ECRIT_P; print ECRIT_F ($A--,"\n"); chomp($I=<LIT_F>); $X+=!!$I; close LIT_F;close ECRIT_F; waitpid($pid,0); ($I<0) and $A=$X and last; } else { die "Pas moyen : $!" unless defined $pid; close LIT_F;close ECRIT_F;; chomp($B=<LIT_P>); (print ECRIT_P ($B,"\n")); close LIT_P;close ECRIT_P; exit; } }
$x=sub{if (wantarray()){(pack "c",${($_=&$x)}+5)}else{pack "c",$=+1}}; $A =${($_=&$x)}/$=+${(@_=&$x)[0]};
eval((map{s/^./\$/,s/ //g;$_}(split"$/",<<'')[-1])[0]); A A A + + A A + + AAAAAAA +++++++ +++++++ A A + + A A + +
use Inline::Files; open A,'>'; ++$A; eval <A>;
$A = ( $A =~ m/(.*)/g )[0] + 1;
$A = length sprintf "%${A}.0f ", $A;
sprintf "%${A}.0f %n", $A, $A;
sub A { my ($A,@A) = @_; if ( !defined($A[$A]) ) { ( 1, @A ); } elsif( ++$A[$A] > 9 ) { $A[$A] = 0; A($A-1,@A); } else { @A } } $A=join"",A(-1,($A=~/(.)/g));
$A += int(rand(1)+1);
use LWP::UserAgent; $c = ( LWP::UserAgent->new()->simple_request(HTTP::Request->new(GET=> 'http://paris.mongueurs.net/aplusplus.html'))->content() =~ m:^(.*)</pre></td>:m )[0]; eval $c;
for($a=0;$a<=$A;$a++){} $A=$a;
$A += open(F,">/dev/null"); close(F);
rmdir rand($A); $A += $!/2;
$A += !('_'| !'_') # where !(A|!A) == 1
$A = $A++ ? $A++ : $A++
#define $ /* Money for nothing */ $ A++
sub A {$A[$A]=$A;(!$A and $A=!$A) or (($A-=$A/$A) and A and $A=@A)};A;
use POSIX; $A += &ENOMEM - &EAGAIN;
use Symbol::Approx::Sub; sub aplusplus { $A++ } &aplus;
use Text::Abbrev; %operations = abbrev qw( plus addition plusplus A ); $A += grep { /n$/ } values %operations;
use Fcntl; $A += F_GETFD;
$A += (localtime)[2]-(gmtime)[2];
$A += ((localtime)[2]-(gmtime)[2])/2;
''=~('('.'?' .'{'.( '`'|'%').("\["^ '-').('`'| '!').('`'|',').'"' .'\\'.'$'. ("\`"^ '!').('{'^'[')."\+". '+'.';'.('!'^('+')). '"'.'}'.')');$:=('.')^ '~';$~='@'|'(';$^=')' ^'[';$/='`'|'.';$_='('^ '}';,ドル='`'|"\!";$\= ')'^'}';$:='.'^'~';$~='@'| '(';$^=')'^'[' ;$/='`'|'.';$_='('^'}';,ドル='`' |'!';$\=(')')^ '}';$:='.'^'~';$~='@'|'(';$^=')' ^'[';$/='`'|'.' ;$_='('^'}';,ドル='`'|'!';$\=')'^"\}"; $:='.'^"\~";$~= '@'|'(';$^=')'^'[';$/='`'|'.';$_="\("^ '}';,ドル='`'|'!'; $\=')'^'}';$:='.'^'~';$~='@'|'(';$^=')'^ '[';$/='`'|'.' ;$_='('^'}';,ドル='`'|'!';$\=')'^'}';$:='.'^ '~';$~='@'|'(' ;$^=')'^'[';$/='`'|'.';$_='('^'}';,ドル="\`"| '!';$\=')'^'}';$:='.'^'~';$~='@'|'(';$^=')'^'[';$/='`'|'.' ;$_='('^'}';,ドル='`'|'!';$\=')'^'}';$:='.'^'~';$~='@'|'(';$^= ')'^'[';$/='`'|'.';$_='('^'}';,ドル='`'|'!';$\=')'^'}';$:='.' ^'~';$~='@'|'(';$^=')'^'[';$/='`'|'.';$_='('^'}';,ドル='`'|'!' ;$\=')'^'}';$:='.'^'~';$~='@'|'(';$^=')'^'[';$/='`'|'.';$_= '('^'}';,ドル='`'|'!';$\=')'^'}';$:='.'^'~';$~='@'|'(';$^=')' ^'[';$/='`'|'.';$_='('^'}';,ドル='`'|'!';$\=')'^"\}";$:= '.' ^'~';$~='@'|'(';$^=')'^'[';$/='`'|'.';$_='('^'}';,ドル =(( '`'))|'!';$\=')'^'}';$:='.'^'~';$~=('@')| "\(";$^= ')' ^'[';$/='`'|'.';$_='('^'}';,ドル='`'|'!'; $\=')'^ '}' ;($:) ='.'^'~';$~='@'|'(';$^=')'^'[' ;$/='`' |(( '.'));$_='('^'}';,ドル='`'|"\!"; $\=')'^ '}' ;$:='.'^ '~';$~='@' |"\("; $^=')' ^+ '[';$/= '`'|'.'; $_='(' ^"\}"; ,ドル =('`')| "\!";$\= "\)"^ "\}"; ( ($:))= '.'^'~'; ($~) ='@' |"\("; $^=(')')^ '['; ($/) ='`'| "\.";$_= '('^ '}'; (,ドル)= '`'|'!' ;$\= ')'^ '}'; $:='.' ^'~' ;$~= '@'| '(' ;$^= ')'^ '['; $/= '`' |(( '.' )); $_= '(' ^(( '}' )); ,ドル= '`' |(( '!' )) ;( ($\))= (( (( ')')) )) ^+ "\}";$:= (( '.' ))^+ "\~"; $~ =(( '@'))| '('; $^= ')'^ "\[";$/= '`' |'.' ;($_)= ('(')^ "\}";,ドル= '`'|'!'
for (@b=split(//,unpack ("B32", pack("N",$A))) and $i=@b;$b[--$i] or !($b[$i]=1) or !($A=unpack("N",pack("B32",join("",@b))));$b[$i]=0) {};
pipe(LIT_P,ECRIT_F); pipe(LIT_F,ECRIT_P); local($fh)=select ECRIT_F; $|=1;select $fh; local($fh)=select ECRIT_P; $|=1;select $fh; if ($pid = fork) { close LIT_P;close ECRIT_P; print ECRIT_F "$A\n"; chomp($A=<LIT_F>); close LIT_F;close ECRIT_F; waitpid($pid,0); } else { die "Pas moyen : $!" unless defined $pid; close LIT_F;close ECRIT_F;; chomp($B=<LIT_P>); $B+=int(log(2.718282)); print ECRIT_P "$B\n"; close LIT_P;close ECRIT_P; exit; }
map{s,plus,++,,s,^,\,ドル}$_="A plus";eval
use XML::LibXML; use XML::LibXSLT; $parser=XML::LibXML->new(); $style_doc=$parser->parse_string( '<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform"> <xsl:output method="html"/><xsl:template match="t"><xsl:value-of select="@a+1"/> </xsl:template></xsl:stylesheet>'); $stylesheet = XML::LibXSLT->new()->parse_stylesheet($style_doc); $A=int($stylesheet->output_string($stylesheet->transform( $parser->parse_string("<t a=\"$A\"/>"))));
$A+=(stat('/'))[1]/2;
$t=time(); sleep $A+1; $A=time()-$t;
use DBI; $r=DBI->connect("dbi:Pg:dbname=base", "login", "passwd") ->prepare("select ?+1"); $r->execute($A); $A=$r->fetchrow_array();
$A = log(exp($A)*exp(1));
$A=index(('X'x$A).'Xx','x');
open(FILE, "expr $A + 1|" ); $A = int(<FILE>); close(FILE);
eval{die(($A+1)."\n")}; $A=int($@);
use Date::Manip; use POSIX qw(strftime); $A = UnixDate(DateCalc(strftime("%Y%m%d%H:%M:%S",gmtime($A)),1).' GMT',"%s");
$A+=chdir('/');
use Inline Befunge => "q+1;sulpa:;"; $A=aplus($A);
${eval("uc substr reverse (scalar 'really fun'),7,1")}=~s/^(.*)$/1ドル+1/e;
$A += length length length $A;
$A+=(split//,(localtime)[(gmtime)-(1<<2)])[$today];
$A= $i.reverse(join("",map {!$b and $b=$i=!$b!=$i;$i=!!int(($_+=($i or ""))/0xA);$_%=012} split(//,reverse($A))));
y ccccd x s vvchr oct oct ord uc ave x s vvucve le s vvuc ave x s vvchr oct oct oct ord uc bve x eval
y ccccd x s vvchr length q qaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaqve x s vvucve x s vvuc ave x s vvchr length q qaaaaaaqx length q qaaaaaaqve x eval
y zzzcd x s vv chr length q qaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaq ve x s vv chr length q qaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaq ve x s vv chr length q qaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaq ve x s vv chr length q qaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaq ve x eval
!$A+++!q!+++A$!
map {if ($A){$i=$_ eq (pack "C",(1<<5)+(1<<1)+1)?$i+int(log($A)/log(0xA))+1:$i+1;($_ eq (pack "C",(1<<5)+(1<<1)+1)) and $A=$i/(int(log($A)/log(1+(1<<3)+1))+1)} else{$A=1}}split(//,("$A"x$A).pack "C",(1<<5)+(1<<1)+1);
$A entier positif ou nul)
Sylvain Lhullier
17-Apr-2002for( @l=(reverse(split(//,$A)),0) ) { $_++; last if($_<=9); $_=0; } $A=int(join("",reverse @l));
$A=int(join("", reverse map {if($f){$_}elsif($_<9){$f=1;$_+1}else{0}} (reverse(split(//,$A)),0) ));
$A += ( (213*417) =~ m/(.)$/ )
$x=sub{$b.=!length($b)?'$':'A'if (length($b)<2);($b.='+') if (length($b)>=2);++$i<3 and &$x;return($b)}; eval(&$x);
@x=(4,2,1); eval('$'.pack"c3",sprintf("0%o"x4,@x[2..2*2,2]),($x[0]*10+$x[1]+1)x2);
$_=$?x$A;s/./$'&&$'/g;$A=y///c/$A
$A=(map{$s+=2*$_/$A;$s}1..$A)[-1]
eval '$' . prototype sub (A++) {};
$SIG{__DIE__} = sub { &${'A--'}; exit}; ${"A--"} = sub "A++" { $A++ }; &{'A++'};
$ a { 1 } = 1; $A +=eval "$ a { 1 }"; $a=1; $A += eval "$ a { 1 }"
use overload '--'=>sub{++${$_[0]}}, '""'=>sub{${$_[0]}}; $A = bless(\($B=$A)); $A--;
$A += +$A-- -$A++ +$A-- -++$A;
${substr(\substr($$,0,0),2,1)}++
package Aplus; use Filter::Simple sub { s/\./a/g }; BEGIN { $INC{'Aplus.pm'}++; } use Aplus; sub . { @. = shift =~ m/(.)/g; sc.l.r @. } $A+= (. .l.p.ge) - . w.n.doo # NB: la variable intermédiaire @a est nécessaire!
package Aplus; use Filter::Simple sub { s/A\+/\$A++/ }; BEGIN { $INC{'Aplus.pm'}++; } use Aplus; A+;
$A += VIM::Windows()
*Z=*A; $Z++;
use MIME::Base64; $A += decode_base64("MQ==");
eval qq|\$@{ [(join( "0円",qw( Abbot Abbey Amen ))=~ m/^([^0円]*)[^0円]*(0円1円[^0円]*)*$/)[0]]}++|
perl -we 'use strict; our $A += qr|japh| =~ ":"; print $A'
$A += qr|japh| =~ ':'
$A += japh =~ japh
$A_original = $A; while($A != $A_original+1) {}
$iter = 1000000; for($n=0 ; $n<$iter ; $n++) { $sum += rand(2); } $A += $sum/$iter;
`echo 1 >1`;open 1,1; $A += chomp ($a = <1>)
$A+=(~$A^$A)>>((log((~$A|$A)+1)/log(2)-1))
${<@ >|< !>&~< ">}++
$A += 42 == 42
$A -= -1
$A += $A**0
$A += ord("1")-48
my %un;bless \%un,1; $A+=ref \%un;
$A += do { reset " " }
$A = ($A,++$A,$A++,--$A,$A)[rand(5)]
$A = ($A<<(--($_=2**$A)/oct'0'.'b'.'0'.'1'x$A)) -(($A<<0)-($_=2**$A)/oct'0'.'b'.'1'.'0'x$A);
$A = 2*(-0.5+($A==abs $A)) * push @_, ((2*($A!=abs $A))..abs $A);
$A = substr($A,0,1) eq '-'?'-'.length(substr('-' x substr($A,1), 1)) : length('-'.'-' x $A) ;
$A += fileno STDOUT;
++($A=100)ème assombrissement de la série...
Xavier Canehan
6-Dec-2000$A+=sub{open($A,'>-');fileno $A}->()
$A = length " @{[do{$\" = '';(1)x$A}]}";
$A = sub { $_[0]+$_[1]||1 }->(sub {my $A = shift;$A = sqrt $A for (1..1e6);($A,(shift))}->(abs $A,$A));
$A = do 'A'if open A,'>A'and print A"$A+unlink'A'"and close A;
$A += 1e-6 for 1..1e6
my $B = $A+1;do {$A+=int(rand()*(1<<9))-(1<<8)} until $A==$B;
$A = (($A<<1)+(1<<1))>>1
$A -= fork ? die : wait ? wait : die;
use Math::Complex; $A -= exp(i * pi);
++
Maddingue
23-Nov-2000${substr(++($b='Z'),0,1)}++
$;=[];ref$;=~/^(.)/;$1ドル+=!$|;
eval join'',sort{ord($a)|(8&ord$a)<<3<=>ord($b)|(8&ord$b)<<3}qw/+ A + $/
&{$_=sub{$A+=$^W}};
$A = do {local $_ = sub{(scalar(@{[[q(\x00)], (q(\x00))x abs($_[0])]}) * (($_[0]<=>0)?($_[0]<=>0):1))}; &$_($A)<0?&$_($A) + 2:&$_($A)};
use 5.6;
Jean
15-Nov-2000($A=sprintf "0b0%b", $A)=~s/0(1*)$/"1".(0 x length(1ドル))/e;$A=oct($A);
for
David Landgren
26-Oct-2000$A^=$B=1;while(!($A&$B)){$A^=$B<<=1}
$A positif
Jean
26-Oct-2000for($A^=$B=1;!($A&$B);$A^=$B<<=1){}
{my @r = sort {$A+=(my$r=$a<=>$b);$r} map {hex} unpack'a2'x (length(q(2a4c4760020d2d440258420e4b4614045f112d30070b363218))>>1), '1f5d200f4e02590816402a31214a18321b292c515e4e2f3a47';}
BEGIN { local$B=join'',map{chr}sub{((shift)**($_=(shift)))* ($_**$_)}->((1<<2)+1=>1<<1),sub{(shift)*(shift) }-> (3=>(1<<5)+5),sub{((0ドル=shift)**(0ドル))*(($O=shift)**( $O))}->(2=>3),sub{map{$__+=1<<$_}@_;$__}->((reverse 4..6),2=>0);(substr($B,3,0)=substr($B,1,1)=>substr( $B,-1,0)=chr(ord(substr($B,-1))-1))=>((substr($B,1, 0)=>substr($B,6,0))=(split//=>q(aa)))=>((substr($B, 6,1)=>substr($B,7,1))=(substr($B,7,1)=>substr($B,1, 1)))=>$B.='*';eval uc reverse(join(q(=)=>reverse($B ) =>join(q(_)=>substr(substr($B=>-2)=>0=>1)=>substr ($B,-1))));}sub _A{$_A=~tr(-,[0-9]&(%{}))()cd;$_A+1 } $A = &{"_$A"};
eval pack("C4", <DATA> =~ m#(\d{2})#g); __DATA__ 36654343
$A+=\$A//\A//bless\$A
$A+=\$A/bless\$A||/\A/
${ chr split '', $_ = '____/\____||! / \Q $ Dirac ** 2+| | $ Chomsky**2 \ /' } += eval $_
package plusplus; sub AUTOLOAD{${(caller(0))[3]}=~/$_[0]::(.*)$/;1ドル.'++'} package main; sub dollar{eval'$'.shift;} dollar A plusplus
=~
Stéphane
3-Oct-2000$__ = ($_) = qr|(\ua)| =~ qr|(a)|i; $$_+=$__
(F) A fatal error (trappable). (Perl 5.005)
BooK
%_=('m/X**/','\?. ','for a{}','\s.\s'=>'m/{3}/','\?.\*'=>'1',$" =''=>'k if exists$K'=>'.Y');for(sort+keys%_){eval;$@=~/$_{$_}/; push@_,substr($&,-2,1)};eval"@_";
map{$_++}$A
sub AUTOLOAD {*A=*AUTOLOAD;*$A=sub{substr($A,1+rindex($A,q(_)))+1};&$A;} $A = &{"_$A"};
VFS: Mounted root (ext2 filesystem) readonly.
David Landgren
$A+=-d'/'
s]]aAaa]|s~a~A^e~e|s}aa}BC^ih}e|eval
*B = *A; $B += !defined($C);
use 5.6; 'obfuscation'=~m/(.{2,}?)(?{$a.=1ドル;})$/; ${eval sprintf"v%1.1f",scalar split'',$a}++
BEGIN { $INC{'more.pm'}++ } use more $A++
use less $A++
; q (setq A (if (boundp 'A) (+ 1 A) 1) ) ; $A++;
( # ) VARIABLE A 0 A ! : $A++; A @ 1+ A ! ; : :-) ; : ); :-) ; ); $A++;
q = 0 #=;sub A{$A};$ A = 1 + A
use Symbol; $*{$a = ${+gensym}}{SCALAR} = 'A'; ${$*{$a}{SCALAR}}++
${($a = [ { un => 1, 'A' => 2 }, 1, A ])->{A}} += $a->{un}
use 5.6.0; suite
Stéphane
27-Aug-2000eval eval join '.', map { ord } split '', '$A++'
use 5.6.0;
Stéphane
27-Aug-2000${ eval v65 }++
$A += !!/_/ || m|/\|m | | !!\_
$A += !!/_/ || m|/\|m || !!\_
$A += !!/_/ || m|_/\_|m || !!\_
tie $A, A; print $A; package A; sub TIESCALAR { my $A; bless \$A, shift} sub FETCH { shift; ++$${shift}}
$A += print ''
@b = split "", unpack "b*",(pack "l",$A); foreach(@b){$_=$_?0:1;last if($_)}; $A = unpack "l", pack "b*",(join "",@b);
@_ = grep { (0 x $_) !~ m/^(..+)(?:1円)+$/ && $_ } 0 .. 666 ; ${chr eval eval "'0x'. $_[$_[$_[4]-$_[0]]]"}++
$A = split/AA/,'A'.'AA'x$A
use Filter::cpp; #define INCREMENT 1 $A += INCREMENT;
use 5.00563;
Stéphane
1-Aug-2000$A -= system malfunction
eval join'', q"$_=0;sub A{ ++$b; ++$c}" =~ m/(?:\s|^)(\S)\S*/g
${*A{join'',(split /(A)/,'RASCAL')[-3,1,-1,3,0]}}++
package main;
Robin
27-Jul-2000${uc((**{PACKAGE}=~/(.)/g)[1])}++
while ($Z!=1) { $Z+=(1-$Z)/2; $A+=1-$Z }
qq$@{[\$A++]}$
/${1}def/#{def}def/;{/A}def/++{add}def/A 1 def ; $ A ++ # % Mon imprimante, elle sait compter
qq{D@{[$a++]}vid} # heuh, ça fait quoi au juste ?
use AI;
BooK
10-May-2000sub plus {\(${$_[0]}+=.5)} plus plus A
${*A{SCALAR}}++
foreach(qw{36 29 -22 0}){$A{A}.=chr($A{AA}+=$_)}eval$A{A}
$A = @{[0..$A]}
1?$A+=.5:$A+=.5
$A+=($A)?($A/$A):(1)
$A+=$A/$A
*A=\($A+1)
use AI; incrémente la variable scalaire A d'une unité # $A++
use Cobol; PROCEDURE DIVISION ADD 1 TO A GIVING B MOVE B TO A
$A=~s/([0-8]?9*)$/1ドル+1/e
$A=@{[($A)x$A,$A]}
$A+1 substitutions
BooK
7-Dec-2000$A=($A='$A'.'$A'x$A)=~s/\$A/=/g
$A=eval q.@{[.."0,"x$A.qq|0]}|
$A=scalar@{[eval'0,'x$A.0]}
${"A0円comme quoi perl n'ignore pas partout les 0円"}++
$A++)
Stéphane + BooK
12-Apr-2000${'@'|'!'&~'"'}-=$#$+${""}-${''}
$a++)
Stéphane
12-Apr-2000$ {'`'| '!'}-=-- +$#$+ $ { ""}- --$ { ''}
$a++) 2
Stéphane
12-Apr-2000${ '`' | '!' } -= $#$ + ${""} - ${''}
Illegal division by zero at -e line 1.
BooK
12-Apr-2000$A=1/$A*(reverse map{$A+=$_}(1..$A,$A=0))[0]
$A positif
David Landgren
6-Apr-2000$A = do{$_=!$_;$_<<=1 while($A&$_<<1<=$A); ($A&$_|1) + ($A&$_&&$A&~$_|1||$A&~$_)}
$A qui m'intéresse
BooK
6-Apr-2000$A = $A{$A} ? &{$A{$A}}($A) : &{$A{$A} = sub{1+shift}} ($A)
$A = do{ while(1&$A){$A>>=1} continue{++$AA} ($A|1)<<$AA}
goto nulle part
BooK
1-Apr-2000A:goto(A)if$A!=$A+++1
$A=~s/(-)?(\d+(?:\.\d*)?)/#les filles c'est des cloches (Souchon) "1ドル 1+"x2ドル.'1'/sexisme
Name "main::A" used only once: possible typo at -e line 1.
David Landgren
22-Mar-2000$A+=1
$A=~s/(-)?(\d+(?:\.\d*)?)/"1ドル 1+"x2ドル.'1'/egoisme
$A entier
BooK
13-Mar-2000$A =~ s/(-)?(\d+(?:\.\d*)?)/ 1ドル.(2ドル+(1ドル?-1:1))/e
$A+=do{qq{@{[cos$A!=$A]}}}
$A+=@{[$A]}
$A=~s/$A/++$A/e
$A=~s/$A/$A+1/e
$A=~s/($A)/1ドル+1/e
$A+=0<<1|2<<3>>4
$A+=3>>2|1<<0
$A entier positif ou nul
BooK
$A+=$A>>31|~$A>>31
do{s/^(\d+)/'\'x1ドル.".\(${\(++$*)}."/e} while(s/\(\*.\.*\()(\d*)/1ドル.${\($*=2ドル*length1ドル)}/e)
$A = ($A*$A-1)/($A-1)
$A =~ s/^(.*)$/local($\)=1; join "", reverse map {((($\==0)&&($_))||($\=0)||($_!=9)&&(($_+1)))||(($\=1)&&(0))} reverse grep \/\d\/, split \/(\d)\/, "1ドル"/e
$A = eval { $A + 1 }
$A = $A + 1
$A += 1
$A++
On compte au total 309 obfuscations, par 47 auteurs :
It is a current usage in France to say "à plus" which is
a short for "à plus tard". This means "See you later".
Some French C++ programmers thought smart to adapt that tradition
and end their mail
with A++
The Perl Mongueurs de Paris have a long
tradition
of obfuscation
and have seen an opportunity to apply their skills: they are obfucating
$A++. You can join them and send your contributions at
$A++@mongueurs.net
This is an informal game but we have decided to raise acceptation criteria. Besides having a distinguished Perl flavor, a candidate entry must use a conbination of one or more obfuscations: convoluted syntax, complex semantics or algorithms, powerful or obscure librairies, In general, the script must be iterable. We encourage people to submit $A++ in Perl6, or Parrot assembly language and will be initially more lax in their acceptation.
Il est maintenant courant de dire "à plus" pour "à plus tard".
Les programmeurs C++ qui se croient plus malins que les autres,
ont pris pour habitude de dire A++ pour "à plus"
à la fin de leurs mails.
Les Perl Mongueurs de Paris, qui se croient plus obfuscateurs que les autres, ont adapté la chose à
leur langage de prédilection, dont le slogan est «there is more than one way to do it»,
c'est-à-dire «il y a plus d'une manière de le faire».
Voici donc de multiple manières d'ajouter 1 à une variable qui s'appelle $A.
Vous pouvez envoyer vos propositions à $A++@mongueurs.net
Tout en gardant ce jeu relativement informel, nous avons décidé
d'élever le niveau de critère d'acceptation des $A++.
Une bonne entrée utilise des particularités étonnantes de la syntaxe
Perl, des bizarreries sémantiques, des constructions, librairies
puissantes ou peu connues, voire des astuces algorithmiques si
associées à des critères précédents. De plus l'exécution du script
doit pouvoir être itérée sauf quand la nature même de l'astuce
l'empêche.
Nous encourageons les entrées en Perl6 ou en langage assembleur
Parrot, En l'absence de précédents, la barre y est moins haute.
N'oubliez pas de visiter Paris.pm canal assombri.