Data update
This commit is contained in:
Ingy döt Net
parent
5150844a7d
commit
4bb20c9b71
7735 changed files with 38060 additions and 199180 deletions
|
|
@ -1,28 +0,0 @@
|
|||
with Ada.Text_IO; use Ada.Text_IO;
|
||||
|
||||
procedure Lcm_Test is
|
||||
function Gcd (A, B : Integer) return Integer is
|
||||
M : Integer := A;
|
||||
N : Integer := B;
|
||||
T : Integer;
|
||||
begin
|
||||
while N /= 0 loop
|
||||
T := M;
|
||||
M := N;
|
||||
N := T mod N;
|
||||
end loop;
|
||||
return M;
|
||||
end Gcd;
|
||||
|
||||
function Lcm (A, B : Integer) return Integer is
|
||||
begin
|
||||
if A = 0 or B = 0 then
|
||||
return 0;
|
||||
end if;
|
||||
return abs (A) * (abs (B) / Gcd (A, B));
|
||||
end Lcm;
|
||||
begin
|
||||
Put_Line ("LCM of 12, 18 is" & Integer'Image (Lcm (12, 18)));
|
||||
Put_Line ("LCM of -6, 14 is" & Integer'Image (Lcm (-6, 14)));
|
||||
Put_Line ("LCM of 35, 0 is" & Integer'Image (Lcm (35, 0)));
|
||||
end Lcm_Test;
|
||||
|
|
@ -1,13 +0,0 @@
|
|||
Func _LCM($a, $b)
|
||||
Local $c, $f, $m = $a, $n = $b
|
||||
$c = 1
|
||||
While $c <> 0
|
||||
$f = Int($a / $b)
|
||||
$c = $a - $b * $f
|
||||
If $c <> 0 Then
|
||||
$a = $b
|
||||
$b = $c
|
||||
EndIf
|
||||
WEnd
|
||||
Return $m * $n / $b
|
||||
EndFunc ;==>_LCM
|
||||
|
|
@ -1,3 +0,0 @@
|
|||
ConsoleWrite(_LCM(12,18) & @LF)
|
||||
ConsoleWrite(_LCM(-5,12) & @LF)
|
||||
ConsoleWrite(_LCM(13,0) & @LF)
|
||||
|
|
@ -1,63 +0,0 @@
|
|||
IDENTIFICATION DIVISION.
|
||||
PROGRAM-ID. show-lcm.
|
||||
|
||||
ENVIRONMENT DIVISION.
|
||||
CONFIGURATION SECTION.
|
||||
REPOSITORY.
|
||||
FUNCTION lcm
|
||||
.
|
||||
PROCEDURE DIVISION.
|
||||
DISPLAY "lcm(35, 21) = " FUNCTION lcm(35, 21)
|
||||
GOBACK
|
||||
.
|
||||
END PROGRAM show-lcm.
|
||||
|
||||
IDENTIFICATION DIVISION.
|
||||
FUNCTION-ID. lcm.
|
||||
|
||||
ENVIRONMENT DIVISION.
|
||||
CONFIGURATION SECTION.
|
||||
REPOSITORY.
|
||||
FUNCTION gcd
|
||||
.
|
||||
DATA DIVISION.
|
||||
LINKAGE SECTION.
|
||||
01 m PIC S9(8).
|
||||
01 n PIC S9(8).
|
||||
01 ret PIC S9(8).
|
||||
|
||||
PROCEDURE DIVISION USING VALUE m, n RETURNING ret.
|
||||
COMPUTE ret = FUNCTION ABS(m * n) / FUNCTION gcd(m, n)
|
||||
GOBACK
|
||||
.
|
||||
END FUNCTION lcm.
|
||||
|
||||
IDENTIFICATION DIVISION.
|
||||
FUNCTION-ID. gcd.
|
||||
|
||||
DATA DIVISION.
|
||||
LOCAL-STORAGE SECTION.
|
||||
01 temp PIC S9(8).
|
||||
|
||||
01 x PIC S9(8).
|
||||
01 y PIC S9(8).
|
||||
|
||||
LINKAGE SECTION.
|
||||
01 m PIC S9(8).
|
||||
01 n PIC S9(8).
|
||||
01 ret PIC S9(8).
|
||||
|
||||
PROCEDURE DIVISION USING VALUE m, n RETURNING ret.
|
||||
MOVE m to x
|
||||
MOVE n to y
|
||||
|
||||
PERFORM UNTIL y = 0
|
||||
MOVE x TO temp
|
||||
MOVE y TO x
|
||||
MOVE FUNCTION MOD(temp, y) TO Y
|
||||
END-PERFORM
|
||||
|
||||
MOVE FUNCTION ABS(x) TO ret
|
||||
GOBACK
|
||||
.
|
||||
END FUNCTION gcd.
|
||||
|
|
@ -5,7 +5,7 @@ gcd = (m,n => (n == 0) ? (m.Absolute) : (gcd(n,n.mod(m))));
|
|||
|
||||
lcm = (m,n => (m * n).Absolute / gcd(m,n));
|
||||
|
||||
public program()
|
||||
public Program()
|
||||
{
|
||||
console.printLine("lcm(12,18)=",lcm(12,18))
|
||||
Console.printLine("lcm(12,18)=",lcm(12,18))
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,13 +0,0 @@
|
|||
function gcd(integer m, integer n)
|
||||
integer tmp
|
||||
while m do
|
||||
tmp = m
|
||||
m = remainder(n,m)
|
||||
n = tmp
|
||||
end while
|
||||
return n
|
||||
end function
|
||||
|
||||
function lcm(integer m, integer n)
|
||||
return m / gcd(m, n) * n
|
||||
end function
|
||||
|
|
@ -1,5 +1,3 @@
|
|||
(phixonline)-->
|
||||
<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>
|
||||
<span style="color: #0000FF;">?</span><span style="color: #7060A8;">lcm</span><span style="color: #0000FF;">(</span><span style="color: #000000;">12</span><span style="color: #0000FF;">,</span><span style="color: #000000;">18</span><span style="color: #0000FF;">)</span>
|
||||
<span style="color: #0000FF;">?</span><span style="color: #7060A8;">lcm</span><span style="color: #0000FF;">({</span><span style="color: #000000;">12</span><span style="color: #0000FF;">,</span><span style="color: #000000;">18</span><span style="color: #0000FF;">})</span>
|
||||
<!--
|
||||
with javascript_semantics
|
||||
?lcm(12,18)
|
||||
?lcm({12,18})
|
||||
|
|
|
|||
|
|
@ -1,16 +0,0 @@
|
|||
function gcd ($a, $b) {
|
||||
function pgcd ($n, $m) {
|
||||
if($n -le $m) {
|
||||
if($n -eq 0) {$m}
|
||||
else{pgcd $n ($m-$n)}
|
||||
}
|
||||
else {pgcd $m $n}
|
||||
}
|
||||
$n = [Math]::Abs($a)
|
||||
$m = [Math]::Abs($b)
|
||||
(pgcd $n $m)
|
||||
}
|
||||
function lcm ($a, $b) {
|
||||
[Math]::Abs($a*$b)/(gcd $a $b)
|
||||
}
|
||||
lcm 12 18
|
||||
|
|
@ -1,16 +0,0 @@
|
|||
function gcd ($a, $b) {
|
||||
function pgcd ($n, $m) {
|
||||
if($n -le $m) {
|
||||
if($n -eq 0) {$m}
|
||||
else{pgcd $n ($m%$n)}
|
||||
}
|
||||
else {pgcd $m $n}
|
||||
}
|
||||
$n = [Math]::Abs($a)
|
||||
$m = [Math]::Abs($b)
|
||||
(pgcd $n $m)
|
||||
}
|
||||
function lcm ($a, $b) {
|
||||
[Math]::Abs($a*$b)/(gcd $a $b)
|
||||
}
|
||||
lcm 12 18
|
||||
|
|
@ -1,4 +1,10 @@
|
|||
# Experimental!
|
||||
# Greatest Common Divisor using Euclidean algorithm
|
||||
Gcd ← ⊙◌⍢(⟜◿:|±,)
|
||||
Gcd ← ⊙◌⍢(⤙˜◿|◡⋅±)
|
||||
# Least Common Multiple
|
||||
Lcm ← ÷⊃(Gcd|⌵×)
|
||||
Gcd 6 20
|
||||
# Experimental built-in GCD.
|
||||
∨ 6 20
|
||||
|
||||
Lcm 14 15
|
||||
|
|
|
|||
|
|
@ -1,30 +0,0 @@
|
|||
Function LCM(a,b)
|
||||
LCM = POS((a * b)/GCD(a,b))
|
||||
End Function
|
||||
|
||||
Function GCD(a,b)
|
||||
Do
|
||||
If a Mod b > 0 Then
|
||||
c = a Mod b
|
||||
a = b
|
||||
b = c
|
||||
Else
|
||||
GCD = b
|
||||
Exit Do
|
||||
End If
|
||||
Loop
|
||||
End Function
|
||||
|
||||
Function POS(n)
|
||||
If n < 0 Then
|
||||
POS = n * -1
|
||||
Else
|
||||
POS = n
|
||||
End If
|
||||
End Function
|
||||
|
||||
i = WScript.Arguments(0)
|
||||
j = WScript.Arguments(1)
|
||||
|
||||
WScript.StdOut.Write "The LCM of " & i & " and " & j & " is " & LCM(i,j) & "."
|
||||
WScript.StdOut.WriteLine
|
||||
Loading…
Add table
Add a link
Reference in a new issue