perl.golf

perl.golf http://www.nntp.perl.org/group/perl.golf/ ... Copyright 1998-2008 perl.org Mon, 06 Oct 2008 13:59:22 +0000 ask@perl.org scrabble word scorer by Jasper Hi, y'all, Can anyone beat 55 on this? I don't know if we ever did it as a challenge. Should I search for it in the book? -- Jasper http://www.nntp.perl.org/group/perl.golf/2008/06/msg2506.html Tue, 17 Jun 2008 03:44:15 +0000 Re: 答复: A challenge to explain the strange results (under linux) by Daniel Tiefnig Zhu Shanshan wrote: > As you said, when I substituted "s/\r\n$//" with "chomp", it did > work. After looking up the explanation of "chomp" in perldoc, I found > "chomp", which I always used to remove the newline previous, removes > any trailing string that corresponds to the current value of "$/". Hej, JFTR, you may also want to have a look at "perldoc perlport". The first issue discussed is "Newlines". lg, daniel http://www.nntp.perl.org/group/perl.golf/2008/06/msg2505.html Thu, 12 Jun 2008 09:56:56 +0000 答复: A challenge to explain the strange results (under linux) by Zhu Shanshan Thanks. As you said, when I substituted "s/\r\n$//" with "chomp", it did work. After looking up the explanation of "chomp" in perldoc, I found "chomp", which I always used to remove the newline previous, removes any trailing string that corresponds to the current value of "$/". And this time, it removed "\n" for me. I'm really puzzled by this phenomena, because I always work with "chomp". I guessed the problem came from the new SFTP software used recently. Then I compared it with WinSCP using the same script. Bingo! WinSCP has deleted "\r" for me and that's why I could luckily work, previous. Anyway, thank you again! -----邮件原件----- 发件人: Ronald J Kimball [mailto:rjk-perl-golf@tamias.net] 发送时间: 2008年6月12日 12:28 收件人: Zhu Shanshan 抄送: Perl Golf 主题: Re: A challenge to explain the strange results (under linux) I would bet that your color.txt file has Windows line endings on all platforms. If you do this: perl test.pl color.txt | less you may find that you're getting output after all. Make sure color.txt has Unix line endings on the Linux machines. Here's one way to fix it: perl -pi -e 'tr/\r//d' color.txt Ronald http://www.nntp.perl.org/group/perl.golf/2008/06/msg2504.html Wed, 11 Jun 2008 22:30:31 +0000 Re: A challenge to explain the strange results (under linux) by Ronald J Kimball I would bet that your color.txt file has Windows line endings on all platforms. If you do this: perl test.pl color.txt | less you may find that you're getting output after all. Make sure color.txt has Unix line endings on the Linux machines. Here's one way to fix it: perl -pi -e 'tr/\r//d' color.txt Ronald http://www.nntp.perl.org/group/perl.golf/2008/06/msg2503.html Wed, 11 Jun 2008 21:28:28 +0000 A challenge to explain the strange results (under linux) by Zhu Shanshan I used perl "v5.8.5 built for i386-linux-thread-multi". My data: ##################### File:color.txt chartreuse deeppink goldenrod lightblue dodgerblue darkgoldenrod My scripts: ##################### File: test.pl use strict; use warnings; open IN,"color.txt" or die; while (<IN>){ chomp; print "$_"; } close IN; Results under linux platform(Nothing): "Linux compome 2.6.12-1.1381_FC3smp #1 SMP Fri Oct 21 04:03:26 EDT 2005 i686 i686 i386 GNU/Linux" RedHat "Linux biome 2.6.9-55.ELsmp #1 SMP Fri Apr 20 16:36:54 EDT 2007 x86_64 x86_64 x86_64 GNU/Linux" RedHat "Linux hanlab 2.6.16.46-0.12-smp #1 SMP Thu May 17 14:00:09 UTC 2007 i686 i686 i386 GNU/Linux" OpenSUSE ##################### command: perl test.pl Results under Microsoft Windows XP (in my expectation): ##################### command: d:\soft\bin\perl.exe test.pl Chartreusedeeppinkgoldenrodlightbluedodgerbluedarkgoldenrod It's not really a Perl challenge. But can anyone give me some help or suggestions? Thanks in advance Shanshan Zhu http://www.nntp.perl.org/group/perl.golf/2008/06/msg2502.html Wed, 11 Jun 2008 21:00:16 +0000 Re: google's challenges by Jasper 2008/5/30 Randal L. Schwartz <merlyn@stonehenge.com>: >>>>>> "Jasper" == Jasper <jaspermccrea@gmail.com> writes: > > Jasper> Well, that was a big assumption, then. > > Keep in mind, "obvious" to you is very unlikely "obvious" to everyone else, > since we all run in different circles. I only found out about it because the guy next to me was doing them. They do seem to be somewhat under the radar. The third one opened yesterday. It wasn't really worthwhile writing a program to solve it. The robots one is still the only one I'd consider golfable. If one allows the answers to be in non-integer format, the answer can be pretty small - I have it around 48 with command line arguments. About 70 with the integer format required by google, and that's using Math::BigInt. Have a nice weekend.. -- Jasper http://www.nntp.perl.org/group/perl.golf/2008/05/msg2501.html Fri, 30 May 2008 02:07:12 +0000 Re: google's challenges by merlyn >>>>> "Jasper" == Jasper <jaspermccrea@gmail.com> writes: Jasper> Well, that was a big assumption, then. Keep in mind, "obvious" to you is very unlikely "obvious" to everyone else, since we all run in different circles. -- Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 0095 <merlyn@stonehenge.com> <URL:http://www.stonehenge.com/merlyn/> Smalltalk/Perl/Unix consulting, Technical writing, Comedy, etc. etc. See http://methodsandmessages.vox.com/ for Smalltalk and Seaside discussion http://www.nntp.perl.org/group/perl.golf/2008/05/msg2500.html Thu, 29 May 2008 18:02:43 +0000 Re: google's challenges by Bram On Tue, 27 May 2008 13:27:54 +0200, Jasper <jaspermccrea@gmail.com> wrote: > Has anyone been golfing the google challenges? What challenges? > > I've got the robot one to around 74 characters (not including the 'use > Math::BigInt' :)) > > The other one didn't seem all that interesting in comparison.. > > ~~~tumbleweed~~~ http://www.nntp.perl.org/group/perl.golf/2008/05/msg2499.html Tue, 27 May 2008 06:54:07 +0000 Re: google's challenges by Jasper 2008/5/27 Bram <p5p@perl.wizbit.be>: > On Tue, 27 May 2008 13:27:54 +0200, Jasper <jaspermccrea@gmail.com> wrote: > >> Has anyone been golfing the google challenges? > > What challenges? Well, that was a big assumption, then. http://treasurehunt.appspot.com/ Two so far, more on the way, first to complete them all correctly wins a prize. An Aston Martin, I think. -- Jasper http://www.nntp.perl.org/group/perl.golf/2008/05/msg2498.html Tue, 27 May 2008 06:15:41 +0000 google's challenges by Jasper Has anyone been golfing the google challenges? I've got the robot one to around 74 characters (not including the 'use Math::BigInt' :)) The other one didn't seem all that interesting in comparison.. ~~~tumbleweed~~~ -- Jasper http://www.nntp.perl.org/group/perl.golf/2008/05/msg2497.html Tue, 27 May 2008 04:28:02 +0000 Re: Just chipping in... by Jasper stupid reply-to 2008/5/19 Jasper <jaspermccrea@gmail.com>: > 2007/11/20 Tuomo Salo <bass@iki.fi>: >> This one has no performance issues and is even a little bit shorter. Yay! >> >> #!perl -l >> $r=qr/$(??{$r})*$/;map/^$r+$/&&print,glob"{(,)}"x2x pop > > OK, so it took me a number(!) of months, but this is shorter, and > prints in order.. > > #!perl -l > eval'$c-=fork?wait&&$c?s//(/:.1:- s//)/;'x2x pop||print > > Didn't I read a proverb somewhere about a tortoise and a hare, and the > tortoise losing his job, and the hare shifting the blame onto the > ex-tortoise? > -- > Jasper > -- Jasper http://www.nntp.perl.org/group/perl.golf/2008/05/msg2496.html Mon, 19 May 2008 08:59:47 +0000 Re: Upcoming event by Peter Johncke ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ "Keep On Swinging" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Great Chain [http://rs6.net/tn.jsp?e=001bTia2OQdbhzJoyecAuMdehbAb848anStrR0Y5F_vzWufXVBQgwH2acZqZ4ApMTo5AJi7tF9_N1ibE_I4Nx-03nqr9_sCGFB7G166IHlrES6GWwuRLxKgipl2QR64teEl] ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ "The Trick Shot Master presents an unforgettable Golf Spectacle unlike anything you have ever seen" Peter Johncke "The Trick Shot Master" brings you a Golf Show unlike anything you have ever seen. . Peter travels all over the world with his amazing show. For information and booking an appearance for your next event contact us by calling or email: The Trick Shot Master Tel. +1-561-627-2437 E-mail: info@trickshotmaster.com [mailto:info@trickshotmaster.com] www.trickshotmaster.com [http://rs6.net/tn.jsp?e=001bTia2OQdbhzJoyecAuMdehbAb848anStrR0Y5F_vzWufXVBQgwH2acZqZ4ApMTo5AJi7tF9_N1ibE_I4Nx-03nqr9_sCGFB7G166IHlrES6GWwuRLxKgipl2QR64teEl] ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ The Trick Shot Master 1464 Cupcoy Ave Jupiter, Florida 33458 +1 (561) 627-2437 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Forward email http://ui.constantcontact.com/sa/fwtf.jsp?m=1010984599072&ea=golf@perl.org&a=1102057415786 This email was sent to golf@perl.org, by peter@trickshotmaster.com Update Profile/Email Address http://visitor.constantcontact.com/d.jsp?v=001hFoVgtC2xN_mgYHQeroXohXla1D0SDLhJVk7fIUtPzidW6VpiZujCdohtSmpJoc-iXF6s2S9ilw%3D&p=oo Instant removal with SafeUnsubscribe(TM) http://visitor.constantcontact.com/d.jsp?v=001hFoVgtC2xN_mgYHQeroXohXla1D0SDLhJVk7fIUtPzidW6VpiZujCdohtSmpJoc-iXF6s2S9ilw%3D&p=un Privacy Policy: http://ui.constantcontact.com/roving/CCPrivacyPolicy.jsp Email Marketing by Constant Contact(R) www.constantcontact.com The Trick Shot Master | 1464 Cupcoy Ave | Jupiter | FL | 33458 http://www.nntp.perl.org/group/perl.golf/2008/04/msg2495.html Mon, 14 Apr 2008 02:35:38 +0000 Re: Just chipping in... by Jasper if anyone is still listening (ha) - someone reminded me of this last week, so I spent another 10 minutes looking at it. #!perl -l eval'$c-=fork?$c?s//(/:exit:- s//)/;'x2x pop or print is the shortest I can get with this forking method, which still prints the results in a random order, but it's shorter than bass's. Jasper On 23/11/2007, Jasper <jaspermccrea@gmail.com> wrote: > On 23/11/2007, Jasper <jaspermccrea@gmail.com> wrote: > > > Just thought of this. > > > > Probably has performance issues and is a little bit longer. Boo! > > > > #!perl -l > > $l=2*pop;fork?$l>$c++?$_.='(':exit:$c--?$_.=')':exit while$l--;print > > > > Doesn't order correctly (it would if I added a wait), doesn't print > > right, but everyone loves potentially killing their machine with a > > fork. Can't get rid of the two exits, so there seems to be flab for > > sure > > > Flabby indeed > > #!perl -l > $_.=fork?$c--?')':exit:++$c&&'('for($_)x(2*pop);$c||print > > That's the same length as bass, but still with the same problems. A > waitpid does solve the ordering problem, but the only way to stop the > overall parent exiting before all the permutations have printed is to > do something awful. Those solutions add lotsa characters... :( > > -- > > Jasper > -- Jasper http://www.nntp.perl.org/group/perl.golf/2008/03/msg2494.html Mon, 31 Mar 2008 07:27:32 +0000 Re: Just chipping in... by Jasper On 23/11/2007, Jasper <jaspermccrea@gmail.com> wrote: > Just thought of this. > > Probably has performance issues and is a little bit longer. Boo! > > #!perl -l > $l=2*pop;fork?$l>$c++?$_.='(':exit:$c--?$_.=')':exit while$l--;print > > Doesn't order correctly (it would if I added a wait), doesn't print > right, but everyone loves potentially killing their machine with a > fork. Can't get rid of the two exits, so there seems to be flab for > sure Flabby indeed #!perl -l $_.=fork?$c--?')':exit:++$c&&'('for($_)x(2*pop);$c||print That's the same length as bass, but still with the same problems. A waitpid does solve the ordering problem, but the only way to stop the overall parent exiting before all the permutations have printed is to do something awful. Those solutions add lotsa characters... :( -- Jasper http://www.nntp.perl.org/group/perl.golf/2007/11/msg2493.html Fri, 23 Nov 2007 08:17:13 +0000 Re: Just chipping in... by Daniel Tiefnig Tuomo Salo wrote: > This one has no performance issues and is even a little bit shorter. > Yay! AND it does print lines in wrong order! :o) Doesn't it? It does for me. lg, daniel http://www.nntp.perl.org/group/perl.golf/2007/11/msg2492.html Fri, 23 Nov 2007 07:08:54 +0000 Re: Just chipping in... by Jasper On 20/11/2007, Tuomo Salo <bass@iki.fi> wrote: > This one has no performance issues and is even a little bit shorter. Yay! > > #!perl -l > $r=qr/$(??{$r})*$/;map/^$r+$/&&print,glob"{(,)}"x2x pop Just thought of this. Probably has performance issues and is a little bit longer. Boo! #!perl -l $l=2*pop;fork?$l>$c++?$_.='(':exit:$c--?$_.=')':exit while$l--;print Doesn't order correctly (it would if I added a wait), doesn't print right, but everyone loves potentially killing their machine with a fork. Can't get rid of the two exits, so there seems to be flab for sure -- Jasper http://www.nntp.perl.org/group/perl.golf/2007/11/msg2491.html Fri, 23 Nov 2007 04:02:56 +0000 Re: Just chipping in... by Tuomo Salo This one has no performance issues and is even a little bit shorter. Yay! #!perl -l $r=qr/$(??{$r})*$/;map/^$r+$/&&print,glob"{(,)}"x2x pop -bass http://www.nntp.perl.org/group/perl.golf/2007/11/msg2490.html Tue, 20 Nov 2007 13:51:08 +0000 Re: Just chipping in... by Tuomo Salo -----BEGIN PGP SIGNED MESSAGE----- - From the keyboard of Tuomo Salo (2007-11-19 17:52): > From the keyboard of Phil Carmody (2007-11-15 15:05): >> I saw this on sci.math, and thought "one liner" ;-) > > While I could not squeeze this down to a one 80 char line, Scratch that! Trading (any) performance and utility (whatsoever) for brevity, here's finally a one liner version: #!perl -l $r=qr/4(??{$r})*2/;s/^$r*$/y*42*()**print/efor($=x=pop)/2..$= Not only accomplishing the given task, this little script will also use up all your CPU and more! Use argument 4 for extra sluggishness! Argument >= 4 will even overflow the counter variable to protect your precious processor cycles! -bass -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.1 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iQB1AwUBR0MRZ/bPZUB64qcJAQH6oAL/dTSy5U6q0+XCdRizhPC9QV381Lpwja+X 0fZn3IUP9q7ez85RF0j4CP4DSUVbZGNVGnqqNICbNQZo+I2IswG1ZULLtHqiRMkm E5Mq4U7wULsYqVcUPmGvsnz+B8AWA6OG =lT/i -----END PGP SIGNATURE----- http://www.nntp.perl.org/group/perl.golf/2007/11/msg2489.html Tue, 20 Nov 2007 09:04:53 +0000 Re: Just chipping in... by Juho Snellman Tuomo Salo <tuomo.salo@plenware.fi> writes: > From the keyboard of Phil Carmody (2007-11-15 15:05): > > I saw this on sci.math, and thought "one liner" ;-) > > While I could not squeeze this down to a one 80 char line, there is only > one line that does not begin with a # :-) > > #!perl -l > $\=~s#(.*)\n#"$1(\n"x($1=~y/(//<$a)."$1)\n"x($1=~y/)//*2<$_-1) > #gefor 1..2*($a=pop);print The following is technically speaking not a one-liner, but is 80 characters total split to multiple lines: #!perl $_||=11x pop;/1(1*) ?(1?)/?map$_&&do$0,$1!=$'&&"$`($1 1$2$'","$`)$1 $'"x$2:print -- Juho Snellman http://www.nntp.perl.org/group/perl.golf/2007/11/msg2488.html Tue, 20 Nov 2007 01:21:09 +0000 Re: Just chipping in... by Phil Carmody --- Tuomo Salo <tuomo.salo@plenware.fi> wrote: > -----BEGIN PGP SIGNED MESSAGE----- > - From the keyboard of Phil Carmody (2007-11-15 15:05): > > I saw this on sci.math, and thought "one liner" ;-) > > While I could not squeeze this down to a one 80 char line, there is only > one line that does not begin with a # :-) > > #!perl -l > $\=~s#(.*)\n#"$1(\n"x($1=~y/(//<$a)."$1)\n"x($1=~y/)//*2<$_-1)#gefor 1..2*($a=pop);print > > I tried to do the generation by hand, implemented that method as a > regex, and polished (or should I say disfigured) the result with a > couple of standard golfing tricks. Notice the lack of escaped parens, > btw :-) > > There are probably a couple of mrmagoos there, at least you could lose > a couple of chars (along with any perceived one-linerness) by replacing > the "\n":s with literal newlines. Masterful! Hyvä Tuomo! I can only begin to work out how it works! Phil () ASCII ribbon campaign () Hopeless ribbon campaign /\ against HTML mail /\ against gratuitous bloodshed [stolen with permission from Daniel B. Cristofani] ____________________________________________________________________________________ Never miss a thing. Make Yahoo your home page. http://www.yahoo.com/r/hs http://www.nntp.perl.org/group/perl.golf/2007/11/msg2487.html Mon, 19 Nov 2007 18:45:00 +0000 Re: Just chipping in... by Tuomo Salo -----BEGIN PGP SIGNED MESSAGE----- - From the keyboard of Phil Carmody (2007-11-15 15:05): > I saw this on sci.math, and thought "one liner" ;-) While I could not squeeze this down to a one 80 char line, there is only one line that does not begin with a # :-) #!perl -l $\=~s#(.*)\n#"$1(\n"x($1=~y/(//<$a)."$1)\n"x($1=~y/)//*2<$_-1) #gefor 1..2*($a=pop);print I tried to do the generation by hand, implemented that method as a regex, and polished (or should I say disfigured) the result with a couple of standard golfing tricks. Notice the lack of escaped parens, btw :-) There are probably a couple of mrmagoos there, at least you could lose a couple of chars (along with any perceived one-linerness) by replacing the "\n":s with literal newlines. Cheers, -bass -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.1 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iQB1AwUBR0GxVPbPZUB64qcJAQFFFAL/ejNBEfzY9+PwNSS+EtakB+UC7RpfzBu5 FmVwYQ8JXoEiCPjuSfqEA+D6I5qhioNhQsuMOoG3YEbaWbhjRuEpTcNmdIhbDBi1 g8sRXE1rOlCO+wgR4ZVUjXoROrhj4AoN =4jPH -----END PGP SIGNATURE----- http://www.nntp.perl.org/group/perl.golf/2007/11/msg2486.html Mon, 19 Nov 2007 10:40:40 +0000 Re: Just chipping in... by Jasper I give up! I should learn to check before posting... This doesn't work either. It looks like it does without counting the results, though :S On 15/11/2007, Jasper <jaspermccrea@gmail.com> wrote: > On 15/11/2007, Jasper <jaspermccrea@gmail.com> wrote: > > > > > \$h{$_='()'x$ARGV[0]}; > > \$h{$_,reverse}while s/\)(.*?)$/$1()/; > > print for sort keys %h; > > Phil points out that reverse isn't actually a mirror (and scalar > reverse makes this horribly incorrect), so it turns out I have to do > this in two passes. > > \$h{$_='()'x $ARGV[0]}; > \$h{$_}while s/$(.*?)$/$1()/; > $_='()'x pop; > \$h{$_}while s/(.*)$(.*?)$/$1()$2/; > print for sort keys %h; > > Hopefully someone can fix that :D > > -- > Jasper > -- Jasper http://www.nntp.perl.org/group/perl.golf/2007/11/msg2485.html Thu, 15 Nov 2007 08:47:20 +0000 Re: Just chipping in... by Jasper On 15/11/2007, Jasper <jaspermccrea@gmail.com> wrote: > > \$h{$_='()'x$ARGV[0]}; > \$h{$_,reverse}while s/$(.*?)$/$1()/; > print for sort keys %h; Phil points out that reverse isn't actually a mirror (and scalar reverse makes this horribly incorrect), so it turns out I have to do this in two passes. \$h{$_='()'x $ARGV[0]}; \$h{$_}while s/$(.*?)$/$1()/; $_='()'x pop; \$h{$_}while s/(.*)$(.*?)\(/$1()$2/; print for sort keys %h; Hopefully someone can fix that :D -- Jasper http://www.nntp.perl.org/group/perl.golf/2007/11/msg2484.html Thu, 15 Nov 2007 08:45:49 +0000 Re: Just chipping in... by Jasvir Nagra To golf it a little to make it into an actual one-liner (even if a rather long one!) #!/usr/bin/perl -l $n=pop;$"=$/;print"@{[w($n)]}";sub w{my($n)=pop;!$n?@_="":$n==1?@_="()":a;if($n>1){for$k(0..--$n){for$p(w($k)){push@_,"($p)$_"for w($n-$k)}}}@_} -- jas On Nov 15, 2007 2:05 PM, Phil Carmody <thefatphil@yahoo.co.uk> wrote: > I saw this on sci.math, and thought "one liner" ;-) > I even think a DP non-recursive approach should be quite quick. > Keeping the output in the logical order might cost a few strokes. > > > #!/usr/bin/perl > > $count = $ARGV[0]; > > print join "\n", pren($count), ""; > > sub pren > { > my @list = (); > > (my $n) = @_; > if ($n == 0) {push(@list, "")} > elsif($n == 1) {push(@list, "()")} > elsif($n > 1) > { > foreach $k (0 .. $n-1) > { > foreach $p1 (pren($k)) > { > foreach $p2 (pren($n - 1 - $k)) > { > push @list, sprintf "(%s)%s", $p1, $p2; > } > } > } > } > return @list; > } > ________________________ > > > $ ./parens.pl 5 | cat -n > 1 ()()()()() > 2 ()()()(()) > 3 ()()(())() > 4 ()()(()()) > 5 ()()((())) > 6 ()(())()() > 7 ()(())(()) > 8 ()(()())() > 9 ()((()))() > 10 ()(()()()) > 11 ()(()(())) > 12 ()((())()) > 13 ()((()())) > 14 ()(((()))) > 15 (())()()() > 16 (())()(()) > 17 (())(())() > 18 (())(()()) > 19 (())((())) > 20 (()())()() > 21 (()())(()) > 22 ((()))()() > 23 ((()))(()) > 24 (()()())() > 25 (()(()))() > 26 ((())())() > 27 ((()()))() > 28 (((())))() > 29 (()()()()) > 30 (()()(())) > 31 (()(())()) > 32 (()(()())) > 33 (()((()))) > 34 ((())()()) > 35 ((())(())) > 36 ((()())()) > 37 (((()))()) > 38 ((()()())) > 39 ((()(()))) > 40 (((())())) > 41 (((()()))) > 42 ((((())))) > > > () ASCII ribbon campaign () Hopeless ribbon campaign > /\ against HTML mail /\ against gratuitous bloodshed > > [stolen with permission from Daniel B. Cristofani] > > > ____________________________________________________________________________________ > Never miss a thing. Make Yahoo your home page. > http://www.yahoo.com/r/hs > -- Jasvir Nagra http://www.cs.auckland.ac.nz/~jas http://www.nntp.perl.org/group/perl.golf/2007/11/msg2483.html Thu, 15 Nov 2007 08:01:43 +0000 Re: Just chipping in... by Jasper On 15/11/2007, Jasper <jaspermccrea@gmail.com> wrote: > On 15/11/2007, Jasper <jaspermccrea@gmail.com> wrote: > > On 15/11/2007, Phil Carmody <thefatphil@yahoo.co.uk> wrote: > > > I saw this on sci.math, and thought "one liner" ;-) > > > I even think a DP non-recursive approach should be quite quick. > > > Keeping the output in the logical order might cost a few strokes. > > > > and (mostly) with a regex :):wq > > \$h{$_='()'x$ARGV[0]}; > while(/\)$/){ > s/$(.*?)$/$1()/; > \$h{$_,reverse}; > } > print for sort keys %h; Should read: \$h{$_='()'x$ARGV[0]}; \$h{$_,reverse}while s/$(.*?)$/$1()/; print for sort keys %h; of course! -- Jasper http://www.nntp.perl.org/group/perl.golf/2007/11/msg2482.html Thu, 15 Nov 2007 07:09:57 +0000 Re: Just chipping in... by Jasper On 15/11/2007, Jasper <jaspermccrea@gmail.com> wrote: > On 15/11/2007, Phil Carmody <thefatphil@yahoo.co.uk> wrote: > > I saw this on sci.math, and thought "one liner" ;-) > > I even think a DP non-recursive approach should be quite quick. > > Keeping the output in the logical order might cost a few strokes. > and (mostly) with a regex :):wq \$h{$_='()'x$ARGV[0]}; while(/$$/){ s/$(.*?)$/$1()/; \$h{$_,reverse}; } print for sort keys %h; -- Jasper http://www.nntp.perl.org/group/perl.golf/2007/11/msg2481.html Thu, 15 Nov 2007 07:05:51 +0000 Re: Just chipping in... by Jasper On 15/11/2007, Phil Carmody <thefatphil@yahoo.co.uk> wrote: > I saw this on sci.math, and thought "one liner" ;-) > I even think a DP non-recursive approach should be quite quick. > Keeping the output in the logical order might cost a few strokes. First pass: sub f { my($i,$c,@p)=@_; $i? map{f($i-1,$c+/\(/-/$/,@p,$_)}!$c?'(':$c-$i?qw{) (}:')': print join'',@p } f($ARGV[0]*2); I suppose that will give an undef for 0... -- Jasper http://www.nntp.perl.org/group/perl.golf/2007/11/msg2480.html Thu, 15 Nov 2007 06:50:32 +0000 Just chipping in... by Phil Carmody I saw this on sci.math, and thought "one liner" ;-) I even think a DP non-recursive approach should be quite quick. Keeping the output in the logical order might cost a few strokes. #!/usr/bin/perl $count = $ARGV[0]; print join "\n", pren($count), ""; sub pren { my @list = (); (my $n) = @_; if ($n == 0) {push(@list, "")} elsif($n == 1) {push(@list, "()")} elsif($n > 1) { foreach $k (0 .. $n-1) { foreach $p1 (pren($k)) { foreach $p2 (pren($n - 1 - $k)) { push @list, sprintf "(%s)%s", $p1, $p2; } } } } return @list; } ________________________ $ ./parens.pl 5 | cat -n 1 ()()()()() 2 ()()()(()) 3 ()()(())() 4 ()()(()()) 5 ()()((())) 6 ()(())()() 7 ()(())(()) 8 ()(()())() 9 ()((()))() 10 ()(()()()) 11 ()(()(())) 12 ()((())()) 13 ()((()())) 14 ()(((()))) 15 (())()()() 16 (())()(()) 17 (())(())() 18 (())(()()) 19 (())((())) 20 (()())()() 21 (()())(()) 22 ((()))()() 23 ((()))(()) 24 (()()())() 25 (()(()))() 26 ((())())() 27 ((()()))() 28 (((())))() 29 (()()()()) 30 (()()(())) 31 (()(())()) 32 (()(()())) 33 (()((()))) 34 ((())()()) 35 ((())(())) 36 ((()())()) 37 (((()))()) 38 ((()()())) 39 ((()(()))) 40 (((())())) 41 (((()()))) 42 ((((())))) () ASCII ribbon campaign () Hopeless ribbon campaign /\ against HTML mail /\ against gratuitous bloodshed [stolen with permission from Daniel B. Cristofani] ____________________________________________________________________________________ Never miss a thing. Make Yahoo your home page. http://www.yahoo.com/r/hs http://www.nntp.perl.org/group/perl.golf/2007/11/msg2479.html Thu, 15 Nov 2007 05:06:04 +0000 (polish) golfs archive by Jasper Hey, I'm looking for a list of the polish golfs, with rules and test programs, but kernelpanic.pl, where I expected to find them, seems reluctant to give them up. I'm just organizizing a little intra-company golf for fun, is all, but I don't want the overhead of creating a whole compo.. Anyone keep any of this around? Anyone know specifically of a good one that was fun? I suppose I could grab one of Terje's golfs that I didn't do instead... Thanks -- Jasper http://www.nntp.perl.org/group/perl.golf/2007/07/msg2478.html Tue, 17 Jul 2007 06:14:15 +0000 Re: regexp quickie by Phil Carmody --- Shlomi Fish <shlomif@iglu.org.il> wrote: > On Thursday 28 June 2007, Phil Carmody wrote: > > You guys amaze me! (And gals, too, in case Abigail reads this list. > > Sorry to disappoint you but Abigail is a guy (at least in the context of > Perl): ... > http://www.flickr.com/photos/cogurov/42641335/in/photostream/ Oh, that's going to get confusing... I'll have no idea what personal pronoun to use when referring to hän in the future on littlegolem, usenet, and here. Cop-out#1 - use of Finnish (genderless) pronouns. Phil () ASCII ribbon campaign () Hopeless ribbon campaign /\ against HTML mail /\ against gratuitous bloodshed [stolen with permission from Daniel B. Cristofani] ____________________________________________________________________________________ Don't pick lemons. See all the new 2007 cars at Yahoo! Autos. http://autos.yahoo.com/new_cars.html http://www.nntp.perl.org/group/perl.golf/2007/06/msg2477.html Thu, 28 Jun 2007 03:53:04 +0000 Re: regexp quickie by Shlomi Fish On Thursday 28 June 2007, Phil Carmody wrote: > --- Roy.Johnson@shell.com wrote: > > Mine (borrowing RJK's testing code): $1 will be the last letter > > (non-underscore) before or at the target location; $2 will be the first > > letter at or after the target location, or the last letter if no such > > letter exists. > > > > for (qw/ A_Z_K_ A_____ _____K /) { > > print "$_\n"; > > for my $n (1 .. 6) { > > my $r = $n - 1; > > print "$n: "; > > print /^(?=.{0,$r}([^_]))?.{0,$r}.*?([^_])/ > > ? "[$1] ($2)" : "no match"; > > print "\n"; > > } > > } > > You guys amaze me! (And gals, too, in case Abigail reads this list. In > which case she might reduce that it is for RoRoRo's EinStein bot!) > Sorry to disappoint you but Abigail is a guy (at least in the context of Perl): {{{{{{{{{ Sep 18 22:11:57 <rindolf> fxn: Abigail is a guy, right? Sep 18 22:12:23 <Yaakov> Abigail is a very Dutch, very male person. Sep 18 22:12:35 <fxn> rindolf: yes Sep 18 22:13:49 <rindolf> fxn: is Abigail his psedonym? Sep 18 22:14:25 <fxn> rindolf: I don't know, his name in the conference was Abigail Sep 18 22:14:51 <fxn> rindolf: that's a picture by cog: http://www.flickr.com/photos/cogurov/42641335/in/photostream/ Sep 18 22:14:52 <shorten> fxn's url is at http://xrl.us/hnmc }}}}}}}}} It is indeed a feminine name, though, at least in its Hebrew origin: http://en.wikipedia.org/wiki/Abigail Regards, Shlomi Fish > Phil > > () ASCII ribbon campaign () Hopeless ribbon campaign > /\ against HTML mail /\ against gratuitous bloodshed > > [stolen with permission from Daniel B. Cristofani] > > > > ___________________________________________________________________________ >_________ Building a website is a piece of cake. Yahoo! Small Business gives > you all the tools to get online. http://smallbusiness.yahoo.com/webhosting -- --------------------------------------------------------------------- Shlomi Fish shlomif@iglu.org.il Homepage: http://www.shlomifish.org/ If it's not in my E-mail it doesn't happen. And if my E-mail is saying one thing, and everything else says something else - E-mail will conquer. -- An Israeli Linuxer http://www.nntp.perl.org/group/perl.golf/2007/06/msg2476.html Thu, 28 Jun 2007 02:30:12 +0000 RE: regexp quickie by Phil Carmody --- Roy.Johnson@shell.com wrote: > Mine (borrowing RJK's testing code): $1 will be the last letter > (non-underscore) before or at the target location; $2 will be the first > letter at or after the target location, or the last letter if no such letter > exists. > > for (qw/ A_Z_K_ A_____ _____K /) { > print "$_\n"; > for my $n (1 .. 6) { > my $r = $n - 1; > print "$n: "; > print /^(?=.{0,$r}([^_]))?.{0,$r}.*?([^_])/ > ? "[$1] ($2)" : "no match"; > print "\n"; > } > } You guys amaze me! (And gals, too, in case Abigail reads this list. In which case she might reduce that it is for RoRoRo's EinStein bot!) Phil () ASCII ribbon campaign () Hopeless ribbon campaign /\ against HTML mail /\ against gratuitous bloodshed [stolen with permission from Daniel B. Cristofani] ____________________________________________________________________________________ Building a website is a piece of cake. Yahoo! Small Business gives you all the tools to get online. http://smallbusiness.yahoo.com/webhosting http://www.nntp.perl.org/group/perl.golf/2007/06/msg2475.html Wed, 27 Jun 2007 15:18:25 +0000 RE: regexp quickie by Roy.Johnson > If you want $2 to only ever be the first letter at or after the target > location, you can just tweak the second half of the regex: > > /^(?=.{0,$r}([^_]))?(?:.{$r}.*?([^_]))?/ Save a stroke: /^(?=.{0,$r}([^_]))?(?:.{$r,}?([^_]))?/ Roy http://www.nntp.perl.org/group/perl.golf/2007/06/msg2474.html Wed, 27 Jun 2007 12:49:55 +0000 Re: regexp quickie by Ronald J Kimball On Wed, Jun 27, 2007 at 02:26:35PM -0500, Roy.Johnson@shell.com wrote: > Mine (borrowing RJK's testing code): $1 will be the last letter > (non-underscore) before or at the target location; $2 will be the first > letter at or after the target location, or the last letter if no such > letter exists. > > for (qw/ A_Z_K_ A_____ _____K /) { > print "$_\n"; > for my $n (1 .. 6) { > my $r = $n - 1; > print "$n: "; > print /^(?=.{0,$r}([^_]))?.{0,$r}.*?([^_])/ > ? "[$1] ($2)" : "no match"; > print "\n"; > } > } I wish I'd thought of doing it that way! If you want $2 to only ever be the first letter at or after the target location, you can just tweak the second half of the regex: /^(?=.{0,$r}([^_]))?(?:.{$r}.*?([^_]))?/ Ronald http://www.nntp.perl.org/group/perl.golf/2007/06/msg2473.html Wed, 27 Jun 2007 12:38:34 +0000 RE: regexp quickie by Roy.Johnson Mine (borrowing RJK's testing code): $1 will be the last letter (non-underscore) before or at the target location; $2 will be the first letter at or after the target location, or the last letter if no such letter exists. for (qw/ A_Z_K_ A_____ _____K /) { print "$_\n"; for my $n (1 .. 6) { my $r = $n - 1; print "$n: "; print /^(?=.{0,$r}([^_]))?.{0,$r}.*?([^_])/ ? "[$1] ($2)" : "no match"; print "\n"; } } http://www.nntp.perl.org/group/perl.golf/2007/06/msg2472.html Wed, 27 Jun 2007 12:26:49 +0000 Re: regexp quickie by Phil Carmody --- Ronald J Kimball <rjk-perl-golf@tamias.net> wrote: > On Wed, Jun 27, 2007 at 05:45:54AM -0700, Phil Carmody wrote: > > Say I had a string satisfying /^[A-Z_]{6}$/, but not equal to '______' > > and I wish to extract from that the 1 or 2 letters which are closest to > > the n-th character in the string. Is there a simple regexp to perform > > that task? > > Well, I wouldn't exactly call this regex simple... But I have come up with > one that does it: ... > /^(?(?=.{0,$r}[A-Z]).{0,$r}|.*)([A-Z])(?(?<!^..{$r}).*?([A-Z]|$))/ > /^.{$r}([A-Z])/ || /^.{0,$r}([A-Z]).*?([A-Z]|$)/ || /^.*([A-Z])/ > /^.{$r}([A-Z])|^.{0,$r}([A-Z]).*?([A-Z]|$)|^.*([A-Z])/ Woh! I'm glad that's complicated, as I don't feel so bad just doing it the naive way. (I chose the loop, rather than the joining of the result from two substrs, one using a /^ match and the other using a $/.) I have another idea how to solve the problem of isolating the (1 or) 2 closest real letters: In the A_Z_K_ case, for n=2 (r=1), an equally useful output could be A_Z___ That is, to replace anything beyond the first letter at or after char r with the underscore. Two passes would be necessary, one to strip that which is before, one to strip that which is after. Of course, I can probably simplify things by handling the cases of when there is and is not a letter at the point of interest separately. If there is a letter there, the answer is already found. It's not a big deal, I was just noodling... Thanks for the rather heroic regexps though! Phil () ASCII ribbon campaign () Hopeless ribbon campaign /\ against HTML mail /\ against gratuitous bloodshed [stolen with permission from Daniel B. Cristofani] ____________________________________________________________________________________ Be a better Globetrotter. Get better travel answers from someone who knows. Yahoo! Answers - Check it out. http://answers.yahoo.com/dir/?link=list&sid=396545469 http://www.nntp.perl.org/group/perl.golf/2007/06/msg2471.html Wed, 27 Jun 2007 09:54:03 +0000 Re: regexp quickie by Ronald J Kimball On Wed, Jun 27, 2007 at 05:45:54AM -0700, Phil Carmody wrote: > Say I had a string satisfying /^[A-Z_]{6}$/, but not equal to '______' > and I wish to extract from that the 1 or 2 letters which are closest to > the n-th character in the string. Is there a simple regexp to perform > that task? > > e.g. > if the string=A_Z_K_ then: > if n=1, then I want 'A' (or 'AA', not fussed) > if n=2, then I want 'AZ' > if n=3, then I want 'Z' (or 'ZZ', not fussed) > if n=4, then I want 'ZK' > if n=5 or 6, then I want 'K' (or 'KK', not fussed) > > I can see how to do it with the concatenation of two matches from two > substrs, but that's barely simpler than a naive loop over each character > forwards and backwards. Well, I wouldn't exactly call this regex simple... But I have come up with one that does it: for (qw/ A_Z_K_ A_____ _____K /) { print "$_\n"; for my $n (1 .. 6) { my $r = $n - 1; print "$n: "; /^(?(?=.{0,$r}[A-Z]).{0,$r}|.*)([A-Z])(?(?<!^..{$r}).*?([A-Z]|$))/ && print "$1 $2"; print "\n"; } } This has the advantage of always putting the matched characters in $1 and $2. (Note that $1 is always set; if there is no letter at or before the position, $1 will contain the first letter after the position and $2 will be empty.) Here are two other approaches: /^.{$r}([A-Z])/ || /^.{0,$r}([A-Z]).*?([A-Z]|$)/ || /^.*([A-Z])/ && print "$1 $2"; is simpler, but uses three separate regular expressions. /^.{$r}([A-Z])|^.{0,$r}([A-Z]).*?([A-Z]|$)|^.*([A-Z])/ && print $1 || $4 || "$2 $3"; uses a single regular expression, but the results will be in $1, or in $2 and $3, or in $4. (And if digits were allowed the print logic would need to be modified.) Ronald http://www.nntp.perl.org/group/perl.golf/2007/06/msg2470.html Wed, 27 Jun 2007 08:01:48 +0000 regexp quickie by Phil Carmody Say I had a string satisfying /^[A-Z_]{6}$/, but not equal to '______' and I wish to extract from that the 1 or 2 letters which are closest to the n-th character in the string. Is there a simple regexp to perform that task? e.g. if the string=A_Z_K_ then: if n=1, then I want 'A' (or 'AA', not fussed) if n=2, then I want 'AZ' if n=3, then I want 'Z' (or 'ZZ', not fussed) if n=4, then I want 'ZK' if n=5 or 6, then I want 'K' (or 'KK', not fussed) I can see how to do it with the concatenation of two matches from two substrs, but that's barely simpler than a naive loop over each character forwards and backwards. Phil () ASCII ribbon campaign () Hopeless ribbon campaign /\ against HTML mail /\ against gratuitous bloodshed [stolen with permission from Daniel B. Cristofani] ____________________________________________________________________________________ Moody friends. Drama queens. Your life? Nope! - their life, your story. Play Sims Stories at Yahoo! Games. http://sims.yahoo.com/ http://www.nntp.perl.org/group/perl.golf/2007/06/msg2469.html Wed, 27 Jun 2007 05:46:06 +0000 Re: New Golf by Yanick Champoux On Sunday 11 February 2007 14:17, Andrew Savige wrote: > `/anick wrote: > > Ooooh... A Roman-to-decimal rehash of the Fonality tournament. > > Aah.. Emm... Do you mind if we pursue this conversation later on? > > I suddenly remember I have things to do... > > Thanks `/ for bringing that to my attention. I need another golf game > like a hole in the head. ;-) Ooops. Sorry, I didn't mean to tempt you back into the time-warping hell of golf addiction. This being said, if you need help to wean off this addiction, I recommend joining me to my current retreat. The staff is not terribly convivial (Sister Gertrude, I am pained to say, has bedside manners as rough as her five-o'clock shadow), but the accomodations are superlative (everything -- not only the couches but all furnitures and walls -- is soft, plushy and padded) and the drinks to kill for (my current favorite is the Barbituric Sunrise). > > And if I discreetly, very discreetly scoot close to that group and perk > > my ear, I'd probably hear them passionately bemoan how those darned > > foreigners are butchering that old, venerable sport that Golf is... > > Yep, I just stumbled on another butchering on the discussion board > http://codegolf.com/boards/conversation/view/98: > > "Milk holes in the tests as much as you want" > > Compare that abomination to the gentlemanly conduct of the traditional > game, where exploiting holes in the test program risks excommunication > and where the proper response is to alert the (human) referee with a > test case plugging the hole. You can't replace the traditional human > golf referee with a robot. I'll give you that this approach -- while being understandable considering the desire to have the competition being self-arbitrated -- lacks the panache and gentlemanish flair of our traditional Perl golfs. Nonetheless, I still maintain that they provide a good driving range where one can keep his or her swing in shape for the next big event (and sink vast amounts of time that could otherwise been used for worthy causes). Joy, `/anick http://www.nntp.perl.org/group/perl.golf/2007/02/msg2468.html Tue, 13 Feb 2007 19:54:42 +0000 Re: New Golf by Andrew Savige `/anick wrote: > Ooooh... A Roman-to-decimal rehash of the Fonality tournament. > Aah.. Emm... Do you mind if we pursue this conversation later on? > I suddenly remember I have things to do... Thanks `/ for bringing that to my attention. I need another golf game like a hole in the head. ;-) As you might have guessed, I could not restrain myself from gazing at the magic of the Earthman code lamp from the opposite direction. Though I really enjoyed that eye-popping experience, I'm now ready for the post mortem, to enjoy all the weird and wonderful approaches of the other contestants ... except there isn't one. Oh well, I notice many others have complained about this and the site owners have promised to close challenges and publish the solutions eventually ... when no doubt we'll see a rash of Ton/Mtve "deep post mortem" improvements to the winning solutions. :-) > And if I discreetly, very discreetly scoot close to that group and perk > my ear, I'd probably hear them passionately bemoan how those darned > foreigners are butchering that old, venerable sport that Golf is... Yep, I just stumbled on another butchering on the discussion board http://codegolf.com/boards/conversation/view/98: "Milk holes in the tests as much as you want" Compare that abomination to the gentlemanly conduct of the traditional game, where exploiting holes in the test program risks excommunication and where the proper response is to alert the (human) referee with a test case plugging the hole. You can't replace the traditional human golf referee with a robot. Cheers, /-\ Send instant messages to your online friends http://au.messenger.yahoo.com http://www.nntp.perl.org/group/perl.golf/2007/02/msg2467.html Sun, 11 Feb 2007 11:17:52 +0000