def pgcd(entier1, entier2): if entier2!=0: P=entier1/entier2 entier1_2=entier2 entier2=entier1-(entier2*P) entier1=entier1_2 pgcd(entier1,entier2) else: print entier1
sub pgcd{ $a=@_[0]; $b=@_[1]; if ($a % $b==0){ return $b; }else{ return pgcd($b, $a % $b); } }
def pgcd(a, b): if a % b == 0: return b return pgcd(b, a % b)
public static int pgcd(int a, int b) { int r,q=0; for(;;) { r=a%b; q = (a-r)/b; if (r==0) break; a=b; b=r; } return b; } public static void main(String[ ] args) { System.out.println(pgcd(334,289)); }
let rec pgcd a = function | 0 -> a | b -> pgcd b (a mod b);;
public static int PGCD(int a, int b) { int temp = a%b; if (temp == 0) return b; return PGCD(b, temp); }
; modulo (define (% a b) (remainder a b) ) (define (pgcd a b) (if (= (% a b) 0) b (pgcd b (% a b) ) ) )
proc gcdH {p q} { while {$q != 0} {set q [expr {$p % [set p $q]}]} return [expr {abs($p)}] }