Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: How many stories does it take before you've heard them all?

by BrowserUk (Pope)
on Dec 03, 2018 at 19:33 UTC ( #1226685=note: print w/replies, xml ) Need Help??


in reply to How many stories does it take before you've heard them all?

Imagine if you could listen to the life stories of all 100 billion people that have ever lived. How many repeats would there be? How many distinctly unique?


With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority". The enemy of (IT) success is complexity.
In the absence of evidence, opinion is indistinguishable from prejudice. Suck that fhit
  • Comment on Re: How many stories does it take before you've heard them all?

Replies are listed 'Best First'.
Re^2: How many stories does it take before you've heard them all?
by thezip (Vicar) on Dec 04, 2018 at 00:05 UTC

    Definitely should use a hash for this solution...


    *My* tenacity goes to eleven...
Re^2: How many stories does it take before you've heard them all?
by shmem (Chancellor) on Dec 13, 2018 at 01:48 UTC
    How many distinctly unique?

    As many as there are unique snowflakes.

    perl -le'print map{pack c,($-++?1:13)+ord}split//,ESEL'

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1226685]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (7)
As of 2019-02-21 07:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I use postfix dereferencing ...









    Results (109 votes). Check out past polls.

    Notices?
    • (Sep 10, 2018 at 22:53 UTC) Welcome new users!