Euclidean algorithm for gcd

#include <stdio.h>

int mcd(int n, int m);
int main(void) {
  int n, m;
  printf("Inserire n, m: ");
  scanf("%d%d", &n, &m);

  printf("MCD: %d", mcd(n, m));
  return 0;
}

int mcd(int n, int m) {
  int balance, a = n, b = m;

  while (b != 0) {
    balance = a % b;
    a = b;
    b = balance;
  }

  return a;
}