#include "stdafx.h"

long long kgV(long long m, long long n) {
    if(m < n) { // use smaller digit
        long long x = n;
        n = m;
        m = x;
    }

    for(long long i = 1; i < (m*n); i++) {
        if (m*i % n == 0) { //if m*i multiple of m can be divided by n return it
            return m*i;
        }
    }
    return m*n; //else return m*n, the least common multiple of m and n
}
int main (void) {
    unsigned long long m,n;
    printf("Gib den kleineren Wert ein: ");
    scanf("%llu",&m);
    printf("Gib den größeren Wert ein: ");
    scanf("%llu",&n);

    printf("Ergebnis: %llu\n", kgV(m,n));
   return 0;
}