Minimum Cuts can be made in the Chessboard such that it is not divided into 2 parts | C # implementation of above approach ; function that calculates the maximum no . of cuts ; Driver Code ; Calling function .
using System ; public class GFG { static int numberOfCuts ( int M , int N ) { int result = 0 ; result = ( M - 1 ) * ( N - 1 ) ; return result ; } static public void Main ( ) { int M = 4 , N = 4 ; int Cuts = numberOfCuts ( M , N ) ; Console . WriteLine ( " Maximum ▁ cuts ▁ = ▁ " + Cuts ) ; } }