横着和纵着一共会切到n+m个，然后有gcd(n, m)个会重切

$code$

#include<iostream>
#include<cstdio>

using namespace std;

int a, b;

int gcd(int a, int b)
{
	if(b==0)
		return a;
	else return gcd(b, a%b);
}

int main()
{
	scanf("%d%d", &a, &b);
	printf("%d", a+b-gcd(a, b));
	return 0;
}