#include <iostream>
#include <string>
using namespace std;
int answer=0;
int n=0;
int m=0;
void fn(int a,int b,char** &ch){
  if(ch[a][b]=='0'){
    answer++;
    for(int i=0;i<=a;i++){
      for(int j=0;j<=b;j++){
        if(ch[i][j]=='0'){
          ch[i][j]='1';
        }
        else if(ch[i][j]=='1'){
          ch[i][j]='0';
        }
      }
    }
  }
}
int main(){
  int t=0;
  cin>>t;
  while(t--){
    cin>>n>>m;
    char** ch = new char*[n];
    for(int i=0;i<n;i++){
      ch[i] = new char[m];
    }
    for(int i=0;i<n;i++){
      for(int j=0;j<m;j++){
        cin>>ch[i][j];
      }
    }
    int a=n-1;
    int b=m-1;
    int left=0;
    int up=1;
    while(a!=-1 && b!=-1){
      if(a==-1 && b!=0){
        b--;
        fn(a,b,ch);
      }
      else if(b==-1 && a!=0){
        a--;
        fn(a,b,ch);
      }
      else if(a==0 && b==0){
        if(ch[a][b]=='0'){
            answer++;
 
        }
        a--;b--;
      }
      else{
        fn(a,b,ch);
        for(int i=a-1;i>-1;i--){
            fn(i,b,ch);
        }
        for(int i=b-1;i>-1;i--){
            fn(a,i,ch);
        }
        a--;b--;
      }
    }
    cout<<answer<<endl;
    answer=0;
  }
  return 0;
}

• Problem Description
  Flip the world is a game. In this game a matrix of size N*M is given, which consists of numbers. Each number can be 
  1 or 0 only. The rows are numbered from 1 to N, and the columns are numbered from 1 to M.
  
  Following steps can be called as a single move.
  
  Select two integers x,y (1<=x<=N and 1<=y<=M) i.e. one square on the matrix.
  
  All the integers in the rectangle denoted by (1,1) and (x,y) i.e. rectangle having top-left and bottom-right points as (1,1) and (x,y) are toggled (1 is made 0 and 0 is made1).
  
  For example, in this matrix (N=4 and M=3)
  
  101
  
  110
  
  101
  
  000
  
  if we choose x=3 and y=2, the new state of matrix would be
  
  011
  
  000
  
  011
  
  000
  
  For a given state of matrix, aim of the game is to reduce the matrix to a state where all numbers are 
  
  1. What is minimum number of moves required.
  
  INPUT:
  
  First line contains T, the number of test cases. Each test case consists of two space-separated integers denoting N, M. Each of the next N lines contains string of size M denoting each row of the matrix. Each element is either 0 or 1.
  
  OUTPUT:
  
  For each testcase, print the minimum required moves.
  
  CONSTRAINTS:
  
  1<=T<=30
  1<=N<=20 
  1<=M<=20
  
• Test Case 1
  Input (stdin)1
  5 5
  00011
  00011
  00011
  11111
  11111
  Expected Output1
• Test Case 2
  Input (stdin)2
  4 10
  1101000101
  0110101010
  0010010010
  1110011011
  4 10
  0010001111
  0000111001
  0100010111
  0100111111
  Expected Output18
  19