• Source 
    1. #include <iostream>
    2. using namespace std;
    3.  
    4. int BCNN (int n, int m)
    5. {
    6. 	int a=n, b=m;
    7. 	int tmp;
    8. 	while (m!=0)
    9. 	{
    10. 		tmp = n%m;
    11. 		n=m;
    12. 		m=tmp;
    13. 	}
    14. 	return (a*b)/n;
    15. }
    16.  
    17. int main ()
    18. {
    19. 	int n, m;
    20. 	cin>>n>>m;
    21. 	int all_part = BCNN (n, m);
    22. 	int part_1 = all_part/n;
    23. 	int part_2 = all_part/m;
    24.  
    25. 	int S=0;
    26. 	int count_cut=0;
    27. 	for (int i=1; i<=m; i++)
    28. 	{
    29. 		while (S<part_2)
    30. 		{
    31. 			S+=part_1;
    32. 		}
    33. 		if (S==part_2) S=0;
    34. 		else 
    35. 		{
    36. 			count_cut++;
    37. 			S-=part_2;
    38. 		}
    39. 	}
    40. 	cout << count_cut;
    41. 	return 0;
    42. }