Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Finding the greatest common divisor

by damian1301 (Curate)
on Sep 03, 2001 at 21:56 UTC ( [id://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;