#noxp — Public Fediverse posts

#Perl @PerlWChallenge 386 Task 2: Rational Numbers
#noxp
```
perl -E '
sub f(@x){map{/(\d*).(\d*)(\((\d+)\))?/;($n,$m)=map{length}$2,$4;[(10**$m-1)*
(10**$n*$1+$2)+$4, 10**$n*(10**$m-1)]}@x}for my($x,$y)(@ARGV){($p,$q)=f($x,$y);
say "$x, $y -> ", $p->[0]*$q->[1]==$p->[1]*$q->[0]?"T":"F";}
' "0.(12)" "0.(121)" "0.1(23)" "0.12(32)" "0.1(234)" "0.12(342)" \
"12.99(99)" "13." "0.(123)" "0.1(231)"
```

#Perl @PerlWChallenge 386 Task 2: Rational Numbers
#noxp
```
perl -E '
sub f(@x){map{/(\d*).(\d*)(\((\d+)\))?/;($n,$m)=map{length}$2,$4;[(10**$m-1)*
(10**$n*$1+$2)+$4, 10**$n*(10**$m-1)]}@x}for my($x,$y)(@ARGV){($p,$q)=f($x,$y);
say "$x, $y -> ", $p->[0]*$q->[1]==$p->[1]*$q->[0]?"T":"F";}
' "0.(12)" "0.(121)" "0.1(23)" "0.12(32)" "0.1(234)" "0.12(342)" \
"12.99(99)" "13." "0.(123)" "0.1(231)"
```

#Perl @PerlWChallenge 386 Task 1: Reverse Base
#noxp
```
perl -E '
@d=(0..9,"A".."Z","a".."z","+","/");$v{$d[$_]}=$_ for 0..@d-1;for
my($N,$B)(@ARGV){$r=0;$r=$r*$B+$v{$_} for split "",$N; say "$N, $B -> $r"}
' 101010 2 EEADEE 16 755 8 1BRJB 36 7MyqL 64
```

#Perl @PerlWChallenge 386 Task 1: Reverse Base
#noxp
```
perl -E '
@d=(0..9,"A".."Z","a".."z","+","/");$v{$d[$_]}=$_ for 0..@d-1;for
my($N,$B)(@ARGV){$r=0;$r=$r*$B+$v{$_} for split "",$N; say "$N, $B -> $r"}
' 101010 2 EEADEE 16 755 8 1BRJB 36 7MyqL 64
```

#Perl @PerlWChallenge 385 Task 2: Outermost Parentheses
#noxp
```
perl -E '
for(@ARGV){@x=split"",$_;$c=0;say"$_ -> ",map{$_->[0]}grep
{$_->[1]>0}map{/\(/?[$_,$c++]:[$_,--$c]} split "",$_}
' "()()()" "(((())))" "(()())(())" "()((()))()" "(()(()))(()())"
```

#Perl @PerlWChallenge 385 Task 2: Outermost Parentheses
#noxp
```
perl -E '
for(@ARGV){@x=split"",$_;$c=0;say"$_ -> ",map{$_->[0]}grep
{$_->[1]>0}map{/\(/?[$_,$c++]:[$_,--$c]} split "",$_}
' "()()()" "(((())))" "(()())(())" "()((()))()" "(()(()))(()())"
```

#Perl @PerlWChallenge 385 Task 1: Uncommon Words
#noxp
```
perl -E '
for my($l, $m)(@ARGV){my%h;++$h{$_}for split" ","$l $m";@O=
grep{$h{$_}==1}keys %h;say "$l; $m -> @O"}
' "apple banana apple" "banana orange" "cat dog" "bird fish" \
"the quick brown fox" "the quick" "hello" "hello" \
"blue blue red" "red green green yellow"
```

#Perl @PerlWChallenge 385 Task 1: Uncommon Words
#noxp
```
perl -E '
for my($l, $m)(@ARGV){my%h;++$h{$_}for split" ","$l $m";@O=
grep{$h{$_}==1}keys %h;say "$l; $m -> @O"}
' "apple banana apple" "banana orange" "cat dog" "bird fish" \
"the quick brown fox" "the quick" "hello" "hello" \
"blue blue red" "red green green yellow"
```

#Perl @PerlWChallenge 384 Task 2: Special Binary Substrings
#noxp
```
perl -E '
for(@ARGV){$s=$_;$l=length($s)/2;say"$_ -> ",join" ",map{$s=~
/(0{$_}1{$_})/,$s=~/(1{$_}0{$_})/} 1..$l}
' 0101 000111 000011 10011100 00000
```

#Perl @PerlWChallenge 384 Task 2: Special Binary Substrings
#noxp
```
perl -E '
for(@ARGV){$s=$_;$l=length($s)/2;say"$_ -> ",join" ",map{$s=~
/(0{$_}1{$_})/,$s=~/(1{$_}0{$_})/} 1..$l}
' 0101 000111 000011 10011100 00000
```

#Perl @PerlWChallenge 384 Task 1: Base N
#noxp
```
perl -E '
$"="";@d=(0..9, "A".."Z", "a".."z", "+", "/");for my($N,$B)(@ARGV){$n=$N;
my @O;unshift(@O,$d[$n%$B]),$n=floor $n/$B while($n);say"$N, $B -> @O"}
' 42 2 15642094 16 493 8 2228519 36 123456789 64
```

#Perl @PerlWChallenge 384 Task 1: Base N
#noxp
```
perl -E '
$"="";@d=(0..9, "A".."Z", "a".."z", "+", "/");for my($N,$B)(@ARGV){$n=$N;
my @O;unshift(@O,$d[$n%$B]),$n=floor $n/$B while($n);say"$N, $B -> @O"}
' 42 2 15642094 16 493 8 2228519 36 123456789 64
```

#Perl @PerlWChallenge 383 Task 2: Nearest RGB
#noxp
```
perl -MList::Util=first -E '
@s=qw(00 33 66 99 CC FF);@b=map{hex($_)+25}@s;say"$_ -> ",join"","\#",
map{$v=hex $_; $s[first{$v<=$b[$_]}0..@b-1]}s/\#//r=~/(..)/g for@ARGV;
' "#F4B2D1" "#15E6E5" "#191A65" "#2D5A1B" "#00FF66"
```

#Perl @PerlWChallenge 383 Task 2: Nearest RGB
#noxp
```
perl -MList::Util=first -E '
@s=qw(00 33 66 99 CC FF);@b=map{hex($_)+25}@s;say"$_ -> ",join"","\#",
map{$v=hex $_; $s[first{$v<=$b[$_]}0..@b-1]}s/\#//r=~/(..)/g for@ARGV;
' "#F4B2D1" "#15E6E5" "#191A65" "#2D5A1B" "#00FF66"
```

#Perl @PerlWChallenge 383 Task 1: Similar List
#noxp
```
perl -MList::Util=all,any -E '
for my($f,$s,$t)(@ARGV){my %e;for(split/;\s*/,$t){@e=split " ";push$e{$_}->@*,@e
for @e;}@f=split " ",$f;@s=split " ",$s;push$e{$_}->@*,$_ for @f;$r=@f==@s&&all{
$x=$f[$_];$y=$s[$_];any{$_ eq $y}$e{$x}->@*}0..@f-1;say "$f\n$s\n$t\n-> ", $r?"T":"F"}
' "great acting" "fine drama" "great fine; acting drama" \
"apple pie" "banana pie" "apple peach; peach banana"
```

#Perl @PerlWChallenge 383 Task 1: Similar List
#noxp
```
perl -MList::Util=all,any -E '
for my($f,$s,$t)(@ARGV){my %e;for(split/;\s*/,$t){@e=split " ";push$e{$_}->@*,@e
for @e;}@f=split " ",$f;@s=split " ",$s;push$e{$_}->@*,$_ for @f;$r=@f==@s&&all{
$x=$f[$_];$y=$s[$_];any{$_ eq $y}$e{$x}->@*}0..@f-1;say "$f\n$s\n$t\n-> ", $r?"T":"F"}
' "great acting" "fine drama" "great fine; acting drama" \
"apple pie" "banana pie" "apple peach; peach banana"
```

#Perl @PerlWChallenge 382 Task 2: Replace Question Mark
#noxp
```
perl -E '
for(@ARGV){say "$_ -> ", join " ", f($_);}sub f($s){for($s){
return ($_) unless /\?/;return (f(s/\?/0/r), f(s/\?/1/r));}}
' 01??0 101 ??? 1?10 1?1?0
```

#Perl @PerlWChallenge 382 Task 2: Replace Question Mark
#noxp
```
perl -E '
for(@ARGV){say "$_ -> ", join " ", f($_);}sub f($s){for($s){
return ($_) unless /\?/;return (f(s/\?/0/r), f(s/\?/1/r));}}
' 01??0 101 ??? 1?10 1?1?0
```

#Perl @PerlWChallenge 382 Task 1: Hamiltonian Cycle
#noxp
```
perl -E '
for(@ARGV){say"$_ -> @{f([1],[2..$_])}"}sub f($i, $r){my$l=$i->[-1];@$r||return
g($l+$i->[0])?$i:0;for(0..@$r-1){g($l+$r->[$_])||next;$o=f([@$i,$r->[$_]],
[@$r[0..$_-1,$_+1..@$r-1]]);return $o if $o;}0;}sub g($x){$x==floor(sqrt($x))**2}
' 32 15 34
```

#Perl @PerlWChallenge 382 Task 1: Hamiltonian Cycle
#noxp
```
perl -E '
for(@ARGV){say"$_ -> @{f([1],[2..$_])}"}sub f($i, $r){my$l=$i->[-1];@$r||return
g($l+$i->[0])?$i:0;for(0..@$r-1){g($l+$r->[$_])||next;$o=f([@$i,$r->[$_]],
[@$r[0..$_-1,$_+1..@$r-1]]);return $o if $o;}0;}sub g($x){$x==floor(sqrt($x))**2}
' 32 15 34
```

#Perl @PerlWChallenge 381 Task 2: Smaller Greater Element
#noxp
```
perl -MPDL -E '
for(@ARGV){$p=pdl$_;($x,$y)=$p->minmax;say "$_ -> ",$p->where(($p!=$x)&($p!=$y))->nelem}
' "[2 4]" "[1 1 1 1]" "[1 1 4 8 12 12]" "[3 6 6 9]" "[0 -5 10 -2 4]"
```

#Perl @PerlWChallenge 381 Task 2: Smaller Greater Element
#noxp
```
perl -MPDL -E '
for(@ARGV){$p=pdl$_;($x,$y)=$p->minmax;say "$_ -> ",$p->where(($p!=$x)&($p!=$y))->nelem}
' "[2 4]" "[1 1 1 1]" "[1 1 4 8 12 12]" "[3 6 6 9]" "[0 -5 10 -2 4]"
```

#Perl @PerlWChallenge 381 Task 1: Same Row Column
#noxp
```
perl -MPDL -E '
for(@ARGV){$m=pdl$_;$s=1+sequence($m->dim(0));say "$m-> ",
pdl(map{($_->qsort==$s)->all}$m, $m->transpose)->all?"T":"F";}
' "[ [1 2 3 4][2 3 4 1][3 4 1 2][4 1 2 3] ]" \
"[ [1] ]" \
"[ [1 2 5][5 1 2][2 5 1] ]" \
"[ [1 2 3][1 2 3][1 2 3] ]" \
"[ [1 2 3][3 1 2][3 2 1] ]"
```

#Perl @PerlWChallenge 381 Task 1: Same Row Column
#noxp
```
perl -MPDL -E '
for(@ARGV){$m=pdl$_;$s=1+sequence($m->dim(0));say "$m-> ",
pdl(map{($_->qsort==$s)->all}$m, $m->transpose)->all?"T":"F";}
' "[ [1 2 3 4][2 3 4 1][3 4 1 2][4 1 2 3] ]" \
"[ [1] ]" \
"[ [1 2 5][5 1 2][2 5 1] ]" \
"[ [1 2 3][1 2 3][1 2 3] ]" \
"[ [1 2 3][3 1 2][3 2 1] ]"
```

#Perl @PerlWChallenge 380 Task 2: Reverse Degree
#noxp
```
perl -MList::Util=sum -E '
$z=ord("z")+1;
for(@ARGV){my$p;say"$_ -> ", sum map{++$p*($z-ord $_)}split"";}
' z a bbc racecar zyx
```

#Perl @PerlWChallenge 380 Task 2: Reverse Degree
#noxp
```
perl -MList::Util=sum -E '
$z=ord("z")+1;
for(@ARGV){my$p;say"$_ -> ", sum map{++$p*($z-ord $_)}split"";}
' z a bbc racecar zyx
```

#Perl @PerlWChallenge 380 Task 1: Sum of Frequencies
#noxp
```
perl -MList::Util=max -E '
@v=qw(a e i o u);for(@ARGV){my%c;$c{$_}++for split"",$_;
$v=max @c{@v};delete@c{@v}; say"$_ -> ",$v+max values%c;}
' banana teestett aeiouuaa rhythm x
```

#Perl @PerlWChallenge 380 Task 1: Sum of Frequencies
#noxp
```
perl -MList::Util=max -E '
@v=qw(a e i o u);for(@ARGV){my%c;$c{$_}++for split"",$_;
$v=max @c{@v};delete@c{@v}; say"$_ -> ",$v+max values%c;}
' banana teestett aeiouuaa rhythm x
```

#Perl @PerlWChallenge 379 Task 2: Armstrong Number
#noxp
```
perl -MList::Util=sum -E '
for my($t,$l)(@ARGV){my@r;my@d=(-1);for(0..$l){for(0..@d){last unless ++$d[$_]
==$t;$d[$_]=0;}push@r,$_ if (sum map{$_**@d}@d)==$_}say "$t, $l -> @r";}
' 10 1000 7 1000 16 1000
```

#Perl @PerlWChallenge 379 Task 2: Armstrong Number
#noxp
```
perl -MList::Util=sum -E '
for my($t,$l)(@ARGV){my@r;my@d=(-1);for(0..$l){for(0..@d){last unless ++$d[$_]
==$t;$d[$_]=0;}push@r,$_ if (sum map{$_**@d}@d)==$_}say "$t, $l -> @r";}
' 10 1000 7 1000 16 1000
```

#Perl @PerlWChallenge 379 Task 1: Reverse String
#noxp
```
perl -E '
for(@ARGV){my @x; unshift @x,$_ for split "";say "\"$_\" -> \"", @x,"\""}
' "" "reverse the given string" "Perl is Awesome" "v1.0.0-Beta!" "racecar"
```

#Perl @PerlWChallenge 379 Task 1: Reverse String
#noxp
```
perl -E '
for(@ARGV){my @x; unshift @x,$_ for split "";say "\"$_\" -> \"", @x,"\""}
' "" "reverse the given string" "Perl is Awesome" "v1.0.0-Beta!" "racecar"
```