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 .
#include <bits/stdc++.h> NEW_LINE using namespace std ; int numberOfCuts ( int M , int N ) { int result = 0 ; result = ( M - 1 ) * ( N - 1 ) ; return result ; } int main ( ) { int M = 4 , N = 4 ; int Cuts = numberOfCuts ( M , N ) ; cout << " Maximum ▁ cuts ▁ = ▁ " << Cuts ; return 0 ; }