From: Chris Devers <[EMAIL PROTECTED]>
Date: Tue, 8 Oct 2002 23:18:33 -0400 (EDT)
On a different note, last weekend on NPR there was a puzzle that it seems
to me could be solved pretty neatly by a Perl script, and I'm curious
what solutions people would try for it. Consider the fol
Hmm. I'm not sure that I entirely understand the problem. My guess is
that you have a list of words (that I will call the "catalog"), and a
list of words (that I will call the "query"). For each element of the
query you want to generate a list of the words in the catalog that
contain contai
On Tue, Oct 08, 2002 at 08:07:18AM -0600, Chris Staskewicz wrote:
> Is there an efficient method to find all "continuous" substrings of a
> string. For example, in the word "green", I'd like to parse out:
>
> g, r, e, e, n, gr, re, ee, en, gre, ree, and so on...
$ perl -MString::Substrings -e '
On Tue, 8 Oct 2002, Chris Staskewicz wrote:
> Is there an efficient method to find all "continuous" substrings of a
> string. For example, in the word "green", I'd like to parse out:
>
> g, r, e, e, n, gr, re, ee, en, gre, ree, and so on...
>
> A for loop with a substr command works, but the p
On Tue, 8 Oct 2002, Chris Devers wrote:
> On a different note, last weekend on NPR there was a puzzle that it seems
> to me could be solved pretty neatly by a Perl script, and I'm curious
> what solutions people would try for it. Consider the following string:
>
> 1 2 3 4 5 6 7 8 9=2
On Tuesday, October 8, 2002, at 11:18 PM, Chris Devers wrote
> On a different note, last weekend on NPR there was a puzzle that it
> seems
> to me could be solved pretty neatly by a Perl script, and I'm curious
> what solutions people would try for it. Consider the following string:
>
> 1
ok, i have word from damian that he is planning on visiting here in
january and he will be teaching classes again. this time we will offer 4
days of classes over the week of january 21-24, 2003.
the tentative class schedule is:
Tue 21 Jan: Data munging (day 1)
Wed 22 Jan: Data
On Tue, 8 Oct 2002, Ron Newman wrote:
> On Tuesday, October 8, 2002, at 11:18 PM, Chris Devers wrote
>
> > 1 2 3 4 5 6 7 8 9=2002
> >
> > The problem is to add any number of addition & multiplication
> > operations wherever you'd like on the left such that in the
> > end you have a v
I sent the below message earlier today, and it's in the archives, but I haven't
received it on the list. Has anyone received that email?
---
Since today is the second Tuesday of the month, I've received a couple
emails off list asking if Boston.pm would have a Tech Meeting tonight.
Due to sched
9 matches
Mail list logo
