*** KUE-CHIP2 Assembler ver.2.0 by H.Ochi *** * Calculate Greatest Common Divisor using Euclidean Algorithm * Programmed by Akira Uejima, May. 3, 1992 * A (0 =< A < 128) 80 : A: EQU 80H H Aを入力 * B (0 < B < 128) 81 : B: EQU 81H H Bを入力 * GCD(result) 82 : GCD: EQU 82H 00 : 64 80 LD ACC, [A] 02 : 6C 81 LD IX, [B] 04 : A1 LOOP: SUB ACC, IX 05 : 32 04 BZP LOOP 07 : B1 ADD ACC, IX 08 : C8 EOR IX, ACC 09 : C1 EOR ACC, IX 0A : C8 EOR IX, ACC 0B : 31 04 BNZ LOOP 0D : 74 82 ST ACC, [GCD] 0F : 0F HLT END