Lingua::Pangram

[Stray Toaster]

On Wed, Jan 23, 2002 at 02:50:31PM +0000, Tony Bowden wrote:
> On Wed, Jan 23, 2002 at 02:34:17PM +0000, Tony Bowden wrote:
> >On Wed, Jan 23, 2002 at 02:14:23PM +0000, Steve Rushe wrote:
> >> On Wed, Jan 23, 2002 at 01:51:56PM +0000, Marty Pauley wrote:
> >>> To start, a modified version of Russell's code at 74 strokes:
> >>>> Well a tad shorter, just by rearranging
> >>>>> Same algorithm, shorter version:
> 
> Make that:
> 
> > MP: perl -wnle 'sub p{for("a".."z"){return()unless$_[0]=~/$_/i}1}p($_)&&print'
> > SR: perl -wnle 'sub p{for("a".."z"){return()unless$_[0]=~/$_/i}print}p($_)'
> > TB: perl -wnle 'sub p{for("a".."z"){$_[0]=~/$_/i||return}print}p($_)' 
> > TB: perl -ne'sub p{grep$_[0]=~/$_/i,a..z}p($_)==26&&print'

well, at least mine comes in at under a 100, which is good for me. I
gave up on the pack/unpack business, as it was getting silly. and long.
and taking up too much time. so, for your amusement.....

sub m{1if ord($_)>64&&ord($_)<123}foreach(split'',shift){$true{$_}++if
m($_)}print %true==26?1:0

m.

-- 
No one in the world ever gets what they want and that is beautiful
Everybody dies frustrated and sad and that is beautiful
They want what they're not and I wish they would stop saying,
Deputy dog dog a ding dang depadepa