Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: Sainthood via Seniority Simulation

by delirium (Chaplain)
on Nov 05, 2003 at 12:59 UTC ( #304713=note: print w/replies, xml ) Need Help??


in reply to Sainthood via Seniority Simulation

I think Sainthood can be acheived faster by posting good material, which other users will ++.

If you wanted to cheat, maybe script a supersearch of root nodes from tilly|tye|davorg|merlyn|pg|davido from a year ago and repost them.

It may be even quicker to just bribe Vroom. My paltry $200 got me Friar, which comes to about 40 cents per XP.

Replies are listed 'Best First'.
Re: Re: Sainthood via Seniority Simulation
by Anonymous Monk on Dec 17, 2003 at 21:25 UTC

    A couple of picky remarks.

    1. One year ago, tilly was still missing.
    2. Pg arrived less than one year before your post.
    3. davido came to the Monastery in August. Hard to find his nodes from a year ago.
    4. Copying some of davido's nodes will give you trouble rather than fame and fortune. What do I mean? List his nodes by lowest reputation and read them.

    HTH

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://304713]
help
Chatterbox?
[chacham]: I'm sure this is old, but i just came across it: If you put a million monkeys at a million keyboards, one of them will eventually write a Java program. The rest of them will write Perl programs.
[LanX]: lol
[Corion]: Woo hoo! A new Auralnauts episode!
LanX mean unfair and funny
[LanX]: but most java code looks like from one million monkey using eclipse. ..

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (13)
As of 2018-04-23 16:03 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?