def gcd_subtraction(a, b):

    while a != b:

        if a > b:

            print(f"{a} - {b} = {a-b}")

            a = a - b

        else:

            print(f"{b} - {a} = {b-a}")

            b = b - a

    return a

​

a = 120

b = 25

print("The Euclidean algorithm using subtraction:\n")

print(f"The GCD of {a} and {b} is: {gcd_subtraction(a, b)}")

​

#Python

#include <stdio.h>

​

int gcdSubtraction(int a, int b) {

    while (a != b) {

        if (a > b) {

            printf("%d - %d = %d\n", a, b, a - b);

            a = a - b;

        } else {

            printf("%d - %d = %d\n", b, a, b - a);

            b = b - a;

        }

    }

    return a;

}

​

int main() {

    int a = 120;

    int b = 25;

    printf("The Euclidean algorithm using subtraction:\n\n");

    printf("The GCD of %d and %d is: %d\n", a, b, gcdSubtraction(a, b));

    return 0;

}

​

//C

public class Main {

    public static int gcdSubtraction(int a, int b) {

        while (a != b) {

            if (a > b) {

                System.out.println(a + " - " + b + " = " + (a - b));

                a = a - b;

            } else {

                System.out.println(b + " - " + a + " = " + (b - a));

                b = b - a;

            }

        }

        return a;

    }

​

    public static void main(String[] args) {

        int a = 120;

        int b = 25;

        System.out.println("The Euclidean algorithm using subtraction:\n");

        System.out.println("The GCD of " + a + " and " + b + " is: " + gcdSubtraction(a, b));

    }

}

​

//Java