/*
 * Maxim comu divisor per Algorisme d’Euclides
 * MCD(a,0)=a
 * MCD(a,b) = MCD(b,a%b)
 * Prova-ho amb nums grans com ara [a: 654 b: 2322]
 */
#include <stdio.h>
int a, b, old_a;
main() {
	printf("MCD(a,b):\n");
	printf("a: ");scanf("%d", &a);
	printf("b: ");scanf("%d", &b);
	while(b) {
		old_a = a;
		a = b;
		b = old_a % b;
		printf("a = %d\tb = %d\n", a, b);
	}
	printf("MCD = %d\n", a);
}