Hello Jay!
[EMAIL PROTECTED] (Jay Tilton) wrote:
>> And I agree. It's a beauty. It's evil, devious, unefficient,
>>but it's a real beauty. :)
yep.
> Which easily reduces to a 39.13 version
>
> -l print map/!/?$":'-',glob"{,!,}"x pop
37.19: -l print map'-'^O&$_,glob"{,-,}"x pop
---
Mtv
Yanick <[EMAIL PROTECTED]> wrote:
>On Wed, May 08, 2002 at 06:00:02PM +, Ton Hospel wrote:
>> > -l print map/[3-9]/?'':/1/?$":'-',0..2x pop
>>
>> And notice that for the above argument 3 example the last number is 222,
>> so 2 x 3, which is how you get the 2 x pop for the general case.
>> (it
>> Jasper McCrea <[EMAIL PROTECTED]> writes:
> -l print map/[3-9]/?'':/1/?$":'-',0..2x pop
Cool, someone submitted something like my solution :-)
The cantor set is the set of all the numbers whose base-3
representation doesn't contain a "1" in them. All you need is the set
of all the numb
Le Mercredi 10 Avril 2002 10:01, [EMAIL PROTECTED] a écrit :
> What really blows my mind (like `/anick's mythical mosquito)
> is that Jean-Pierre was *still* able to solve the problem,
> and in a tidy 126 strokes too:
>
> 126.29 Jean-Pierre Vidal Sat Apr 6 23:55:07 2002 -ln
> $h{a,sort/./g}.="$
Well, no. I didn't even try because the rules didn't make sense and I was
confused. This was going to be my first tourney, I'll take a swing at the
next one. I might go back and try the previous ones as I did not look at the
postmortems and see how I do.
--{ Mark E Schoonover KA6WKE
--{ Senior Ha
On Wed, Apr 10, 2002 at 01:55:46AM +0200, Stefan `Sec` Zehl wrote:
> Sec (Hoped he could beat `/anick, but failed - maybe next time :-)
Why me?
(it's a rethorical question, please don't feel the need
to answer it)
Joy,
`/anick
--
1. Protect and Nurture Yours.
2. Never Unn
On Tue, Apr 09, 2002 at 05:41:22PM +, Jean-Pierre Vidal wrote:
> Special thanks to `/anick : I have desperately searched the "tourist" module
> within my box. So you are wrong :-)
Tsk. Of course I ain't. The Tourist.pm module morphs to adapt
to the regional language it has been set i
En op 10 april 2002 sprak Jean-Pierre:
> This is a fact. At the time, I dont understand why I could not see
> the output words were in the input :-(
>
> So, I'm sorry for wasting of your time: thanks for beeing listening
> to me.
>
> Special thanks to `/anick : I have desperately searched the
> "
On Tue, Apr 09, 2002 at 05:41:22PM +, Jean-Pierre Vidal wrote:
> This is a fact. At the time, I dont understand why I could not see the output
> words were in the input :-(
At first I had a similar problem. I started writing a program to
recursively generate all anagrams. Then I re-read the
Le Mardi 9 Avril 2002 17:57, Mark Schoonover a dit :
> I had the same problem...
>
> ..mark
Thank you Mark
Jean-Pierre
--
Jean-Pierre Vidal
[EMAIL PROTECTED]
I had the same problem...
..mark
-Original Message-
From: Jean-Pierre Vidal [mailto:[EMAIL PROTECTED]]
Sent: Tuesday, April 09, 2002 10:41 AM
To: [EMAIL PROTECTED]
Subject: They have eyes, and they can't see (was: Please explain - END)
On Mon, 8 Apr 2002 21:52:41 +, Jean-P
On Mon, 8 Apr 2002 21:52:41 +, Jean-Pierre <[EMAIL PROTECTED]>
said (to Yanick and Stephen)
"I think the answer to my question is so obvious you cannot imagine I do not
know it"
Today, after a good night and a good working day, I know the sentence would
be merely "I think the answer to my
2002 5:29 PM
--=={--=={To: [EMAIL PROTECTED]
--=={--=={Subject: RE: Please explain
--=={--=={
--=={--=={
--=={--=={Mark Schoonover <[EMAIL PROTECTED]> wrote:
--=={--=={
--=={--=={> I can see how the characters in
--=={--=={> elvis and lives word sort the same. So would viles.
--=={I
fully understand the problem
at hand!
Thanks Again!
..mark
--=={-Original Message-
--=={From: Keith C. Ivey [mailto:[EMAIL PROTECTED]]
--=={Sent: Monday, April 08, 2002 5:29 PM
--=={To: [EMAIL PROTECTED]
--=={Subject: RE: Please explain
--=={
--=={
--=={Mark Schoonover <[EMAIL PROTECTED
Mark Schoonover <[EMAIL PROTECTED]> wrote:
> I can see how the characters in
> elvis and lives word sort the same. So would viles. IIUC, seliv
> would sort the same way as viles but seliv is not a word, it is
> merely a string of letters. Am I thinking too hard on this one
> or am I just royally
On Mon, Apr 08, 2002 at 11:05:28PM +, Jean-Pierre Vidal wrote:
> > So, to summarize, there is no dictionary magic, just
> > unwholesome programming dirty tricks. :)
>
> I don't agree,
Well, okay, you're right. Probably that unwholesome's
too feeble a word to describe the brillia
Le Lundi 8 Avril 2002 22:23, Yanick a écrit :
[snip]
> So, to summarize, there is no dictionary magic, just
> unwholesome programming dirty tricks. :)
>
> Joy,
> `/anick
I don't agree, I reduce the problem:
hack
snooped
tables
salt
spiff
feeling
spooned
last
grep
bleats
gas
ablest
fleei
--=={Valid words? The sorted words aren't valid words, if
--=={that's what you mean.
--=={But, for example, you can tell elvis and lives are
--=={anagrams, because for
--=={each of them sort/./g is (e, i, l, s, v).
This is the part that is confusing me. I fairly understand how the
cod
On Mon, Apr 08, 2002 at 09:52:41PM +, Jean-Pierre wrote:
> Le Lundi 8 Avril 2002 20:47, Yanick a écrit :
> >
> > map$1{join$|,sort/./g}.=$_,sort<>;
> >
> > what it means is simply:
> >
> Thks to you Yanick, and to Stephen. I think the answer to my question is so
> obvious you cannot imagine I
Le Lundi 8 Avril 2002 20:47, Yanick a écrit :
>
> map$1{join$|,sort/./g}.=$_,sort<>;
>
> what it means is simply:
>
Thks to you Yanick, and to Stephen. I think the answer to my question is so
obvious you cannot imagine I do not know it, or maybe the question was badly
formulated.
Let me expose i
In article <[EMAIL PROTECTED]>,
Jean-Pierre <[EMAIL PROTECTED]> writes:
> Although I have entered tpr(0,2) as a veteran, although I am in fact a
> veteran, I am also a perl's newbie. I play golf because it is fun, of course,
> but also because it helps me to read perldoc more and more.
>
On Mon, Apr 08, 2002 at 02:07:03PM -0700, Mark Schoonover wrote:
>
> --=={First, sort puts its arguments into list context.
>
> Cool so far...
>
> --=={This is then sorted by the
> --=={sort, and two words are anagrams if and only if they agree
> --=={about their sorted letters.
>
> Huh?? Thi
On Mon, 8 Apr 2002, Mark Schoonover wrote:
>
> --=={First, sort puts its arguments into list context.
>
> Cool so far...
>
> --=={This is then sorted by the
> --=={sort, and two words are anagrams if and only if they agree
> --=={about their sorted letters.
>
> Huh?? This is the part that tr
--=={First, sort puts its arguments into list context.
Cool so far...
--=={This is then sorted by the
--=={sort, and two words are anagrams if and only if they agree
--=={about their sorted letters.
Huh?? This is the part that tripped me up. I don't understand how it knows
if the new words ar
On Mon, 8 Apr 2002, Jean-Pierre wrote:
>
> So : I caught the construction "sort/./g", used by 60% of the solutions, on
> the web, querying for "perl anagram".
>
Oh yes, the top link on Google is quite a clue. I didn't think of doing
that.
--
Stephen Turner, Cambridge, UKhttp://homepage.
On Mon, 8 Apr 2002, Jean-Pierre wrote:
> Although I have entered tpr(0,2) as a veteran, although I am in fact a
> veteran, I am also a perl's newbie. I play golf because it is fun, of course,
> but also because it helps me to read perldoc more and more.
>
> So : I caught the construction "sor
On Mon, Apr 08, 2002 at 08:20:53PM +, Jean-Pierre wrote:
> [..] I caught the construction "sort/./g", used by 60% of the solutions, on
> the web, querying for "perl anagram".
>
> Could someone give me either an explanation or a link?
I guess it would be easier if we expand the expression a
Although I have entered tpr(0,2) as a veteran, although I am in fact a
veteran, I am also a perl's newbie. I play golf because it is fun, of course,
but also because it helps me to read perldoc more and more.
So : I caught the construction "sort/./g", used by 60% of the solutions, on
the web,
28 matches
Mail list logo
