Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: Finding the greatest common divisor

by damian1301 (Curate)
on Sep 03, 2001 at 21:56 UTC ( #109907=note: print w/ replies, xml ) Need Help??


in reply to Finding the greatest common divisor

This just goes to show that a search can always find what you want on PM. This is in the snippets -- greatest common factor.

s&&q+\+blah+&oe&&s<hlab>}map{s}&&q+}}+;;s;\+;;g;y;ahlb;veaD;&&print;


Comment on Re: Finding the greatest common divisor
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (14)
As of 2014-12-22 09:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (113 votes), past polls